Domino tiling count

Count the number of ways to tile an m x n grid completely with 1x2 dominoes (each domino covers two orthogonally adjacent cells, placed horizontally or vertically, no overlaps, no gaps). Return the exact count. The smaller dimension is small (min(m,n) up to ~10); return 0 when m*n is odd.