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: Accepted)

#include <stdio.h>

int main(void){

	long long int N;
	scanf("%lld", &N);

	long long int i, mod = 0;
	long long int ans = 1;

	
	for(i = 0; i < N; i++){
		
		mod = ans % 1000000007;
		ans = mod * ((i + 1) % 1000000007);
		
		while(ans >= 1000000007){
			ans = ans % 1000000007;

			if(ans < 1000000007){
				break;
			}
		}
	}	

	printf("%lld\n", ans);
	return 0;

}