'''
There is an 8x8 chessboard in which two diagonally opposite corners have been cut off. You are given 31 dominos, and a single domino can cover exactly two squares. Can you use the 31 dominos to cover the entire board? Prove your answer (by providing an example of showing why it's impossible).

Hints: 367, 397
'''


def dominos(s):
    pass

if __name__ == '__main__':
    assert dominos('') ==
    assert dominos('') ==
    assert dominos('') ==
    assert dominos('') ==
    assert dominos('') ==
