Dominoes

Very easy

Execution time limit is 1 second

Runtime memory usage limit is 128 megabytes

Given a rectangular board of size $m \times n$ . Find the number of ways to cover it with dominoes, which are rectangles of size $1 \times 2$ cells.

Input

Two integers $m$ and $n (1 \leq m, n \leq 10)$ are given on a single line.

Print the number of ways to completely cover the board with the given dominoes.

Input #1

Answer #1

Input #2

Answer #2

Submissions 585

Acceptance rate 41%