B. Beer Quadrilaterals
time limit per test
3 seconds
memory limit per test
256 megabytes
input
stdin
output
stdout

Andrew Six-Meters and Oleg sat on a two-dimensional plane and looked at four bottles of beer: A, B, C and D. They were discussing the idea of measuring angles in alcohol degrees such that the right angle consists of exactly k alcohol degrees, and other angles are measured proportionally. Suddenly, Andrew said:

"Look at these bottles! They form a strictly convex quadrilateral with a nice property: angles between all pairs of sides and diagonals contain an integer number of alcohol degrees!"

"That's pretty interesting! Also, as you can see, bottles A and C stand at points ( - 1, 0) and (1, 0) respectively, point B is above the line AC, and point D is under the line AC. I wonder how many ways are there to put bottles B and D so that they form such a type of quadrilateral."

Help friends to find an answer to their question.

Input

The input contains a single integer k (2 ≤ k ≤ 150), which is the number of alcohol degrees in the right angle.

Output

Output the number of ways to arrange convex quadrilaterals ABCD with A and C in points ( - 1, 0) and (1, 0) respectively, B located above the line AC, and D located under the line AC, such that the nice Andrew-Oleg beer property is satisfied.

Examples
Input
2
Output
1
Input
3
Output
12
Note

In the first sample, one degree of alcohol is a half of the right angle, i. e. radians, so the only possible arrangement is a square with diagonal AC.

The possible arrangements for the second sample are presented below in natural scale: