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 (GCC 5.4.1) (judge verdict: Wrong Answer)

#include<stdio.h>
#include<stdlib.h>
#include<string.h>

int mod(unsigned long num){
	unsigned long MOD = 1.0E+9;
	MOD += 7;
	return num % MOD;
}

int main(){

	unsigned long MOD = 1.0E+9;
	MOD += 7;
	printf("%ld\n",MOD);

	unsigned long N;
	unsigned long pow = 1;

	scanf("%ld",&N);

	for(int i=1; i<=N; i++){
		pow = pow*i;
		pow = mod(pow);
	}

	printf("%ld\n",pow);

	return 0;
}