Package for this problem was not updated by the problem writer or Codeforces administration after we’ve upgraded the judging servers. To adjust the time limit constraint, solution execution time will be multiplied by 2. For example, if your solution works for 400 ms on judging servers, then value 800 ms will be displayed and used to determine the verdict.

The following languages are only available languages for the problems from the contest

Unknown Language Round #1:

- ActiveTcl 8.5

Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ICPC mode for virtual contests.
If you've seen these problems, a virtual contest is not for you - solve these problems in the archive.
If you just want to solve some problem from a contest, a virtual contest is not for you - solve this problem in the archive.
Never use someone else's code, read the tutorials or communicate with other person during a virtual contest.

No tag edit access

A. Factorial

time limit per test

2 secondsmemory limit per test

64 megabytesinput

standard inputoutput

standard outputPrint the factorial of the given integer number *n*. The factorial of *n* is equal to 1·2·...·*n*.

Input

The only line contains *n* (1 ≤ *n* ≤ 10).

Output

Print the factorial of *n*.

Examples

Input

3

Output

6

Input

5

Output

120

Codeforces (c) Copyright 2010-2019 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Nov/14/2019 15:41:59 (e1).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|