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 Java8 (OpenJDK 1.8.0) (judge verdict: Accepted)

import java.io.IOException;

import java.io.BufferedReader;
import java.io.InputStreamReader;

public class Main {
    final static int INF = 1000000007;

    public static void main(String[] args) throws IOException {
        try (
            BufferedReader reader = new BufferedReader(
                new InputStreamReader(System.in))) {
            final String s = reader.readLine();

            int N = Integer.parseInt(s);

            int power = 1;

            for (int i = 1; i <= N; i++) {
                power = modmulti(power, i);
            }

            System.out.println(power);
        }
    }

    // aとbを掛けた値をmodする(a * b mod p)
    static int modmulti(int a, int b)
    {
        int res = 0;
        int mod = a % INF;
        while (b > 0)
        {
            if ((b & 1) == 1)
            {
                res += mod;
                if (res > INF)
                {
                    res -= INF;
                }
            }
            mod <<= 1;
            if (mod > INF)
            {
                mod -= INF;
            }
            b >>= 1;
        }
        return res;
    }
}