Domino Covering

Consider an 8×8 chessboard that features a unique pattern, meaning that the board rotated in any way is considered different from the original configuration. You have an unlimited number of identical domino pieces, each of which exactly covers two adjacent squares on the board. Using exactly 32 dominoes, your task is to completely cover the chessboard without overlaps or gaps.

This is a result fill type problem; there is no actual input. You only need to compute and output the correct number of ways to cover the chessboard. It is known that the total number of coverings is an 8-digit integer. In mathematical form, the answer is:

Submit only the resulting integer as your answer (without any extra characters).

inputFormat

This problem does not require any input.

outputFormat

Output a single integer representing the total number of ways to cover the board with 32 dominoes.

sample

12988816