**Problem : 3D Maze Problem**

Suppose, an ant is trapped in a maze, with only one way in and one way out.

The maze is a cubic-lattice like structure of dimension NxNxN (Length=Breadth=Height=N). The way in is the left-bottom most point, and the way out is the right top-most point (along the principal diagonal). The below picture shows the maze for N=2.

**Figure 1.**

**Example:**

For, N=1, the grid structure and solution is shown below:

**Figure 2.**

Thus, for N=1, we have a net of 6 ways.

**Input Format:**

Single integer N

**Output Format:**

Output also consists of a single number corresponding to the number of ways the ant can escape the maze.

**Constraints:**

**0<N<=8**

**Example**

Example Number | Sample Input | Sample Output |
---|---|---|

1 | 1 | 6 |

2 | 2 | 90 |

*: If you had solved this question then please put your doubts and answer here in comment box..!!!*

**Note**