Description

FuLao is a person who likes Sudoku very much. He does hundreds of Sudoku every day.

Sudoku is a logic-based, combinatorial number-placement puzzle. In classic sudoku, the objective is to fill a $n^2 *n^2$ grid with digits so that each column, each row, and each of the $n*n$ subgrids that compose the grid(also called "boxes", "blocks", or "regions") contain all of the digits from $1$ to $n^2$. The puzzle setter provides a partially completed grid for players to solve.

For FuLao, a "perfect Sudoku" should have and only one set of solutions. Now he wants to know how many "perfect Sudokus" can be played for a Sudoku with $n=2$ ?

Format

Input

There's no input for this problem.

Output

Output is the solution when n=2.

Samples

(This is just an example, not necessarily the correct answer)

13579

Hints

Both of these are perfect Sudoku.