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: Wrong Answer)

import java.io.InputStream;
import java.util.Scanner;

/**
 * AtCoder Beginner Contest 055<br>
 * B - Training Camp<br>
 * <br>
 * <a href="https://atcoder.jp/contests/abc055/tasks/abc055_b">AtCoderへのリンク</a><br>
 */
public class Main {

    /**
     * エントリポイント
     */
    public static void main(String[] args) {
        // 入力
        int N = input(System.in);
        // 演算
        double power = proc(N);
        // 出力
        System.out.println(power);
    }

    /**
     * 入力値を取得
     */
    static int input(InputStream in) {
        int result = 0;
        try (Scanner sc = new Scanner(in)) {
            result = sc.nextInt();
        }
        return result;
    }

    /**
     *  演算を行う
     */
    static double proc(int N) {
        long power = 1;
        // TODO:実装する
        
        
        double d = 1;
        for( long i = 1; i<=N ; ++i )
        {
          d = d * N;
        }
        return d % ( 10^9 + 7 );


    }

}