Problem:
Score : 200 points

Problem Statement

Snuke loves working out. He is now exercising N times.

Before he starts exercising, his power is 1. After he exercises for the i-th time, his power gets multiplied by i.

Find Snuke's power after he exercises N times. Since the answer can be extremely large, print the answer modulo 10^{9}+7.

Constraints

1 ≤ N ≤ 10^{5}

Input

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

N

Output

Print the answer modulo 10^{9}+7.

Sample Input 1

3

Sample Output 1

6

After Snuke exercises for the first time, his power gets multiplied by 1 and becomes 1.

After Snuke exercises for the second time, his power gets multiplied by 2 and becomes 2.

After Snuke exercises for the third time, his power gets multiplied by 3 and becomes 6.

Sample Input 2

10

Sample Output 2

3628800

Sample Input 3

100000

Sample Output 3

457992974

Print the answer modulo 10^{9}+7.

Solution in C++14 (GCC 5.4.1) (judge verdict: Accepted)

#include <cstdio>
#include <cstdlib>
#define rrep(i,n) for (int i = 1; i <= n; ++i)
using namespace std;

constexpr int MX = 100000, mod = 1000000007;
struct Fact {
  int d[MX+1];
  constexpr Fact(): d() {
    d[0] = 1;
    long long x = 1;
    rrep(i,MX) {
      x = (x*i)%mod;
      d[i] = x;
    }
  }
};
constexpr Fact F = Fact();

int main() {
  char buf[10];
  fgets(buf, 10, stdin);
  printf("%d\n", F.d[atoi(buf)]);
  return 0;
}