#ABC273A. [ABC273A] A Recursive Function

[ABC273A] A Recursive Function

Score : 100100 points

Problem Statement

A function f(x)f(x) defined for non-negative integer xx satisfies the following conditions:

  • f(0)=1f(0) = 1;
  • f(k)=k×f(k1)f(k) = k \times f(k-1) for all positive integers kk.

Find f(N)f(N).

Constraints

  • NN is an integer such that 0N100 \le N \le 10.

Input

The input is given from Standard Input in the following format:

NN

Output

Print the answer as an integer.

2
2

We have $f(2) = 2 \times f(1) = 2 \times 1 \times f(0) = 2 \times 1 \times 1 = 2$.

3
6

We have f(3)=3×f(2)=3×2=6f(3) = 3 \times f(2) = 3 \times 2 = 6.

0
1
10
3628800