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 (Clang 3.8.0) (judge verdict: Wrong Answer)

#include<stdio.h>
#include<math.h>

int main(){
	
	int N,i;
	long long int j=pow(10,9)+7,power=1,ans=1;
	
	scanf("%d",&N);
	
	for(i=1;i<=N;i++){
		power*=i;
		//printf("%lld\n",power);
		if(power>j){
			ans*=power%j;
			power=1;
		}else {
			ans*=i;
		}
		if(ans>j){
			ans%=j;
		}
		//printf("ans:%lld\n",ans);
	}
	
	
	printf("\n%lld\n",ans);
	
	return 0;
}