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 Common Lisp (SBCL 2.0.3) (judge verdict: Accepted)

(declaim (optimize (speed 3) (debug 0) (safety 0)))

(let ((x (read)))
  (declare (type fixnum x))

  (defun solve (n &optional (i 0) (ans 1))
    (declare (type fixnum n i ans))
    (if (= i n)
      ans
      (solve n (the fixnum (1+ i)) (the fixnum (mod (* ans (1+ i)) (+ (expt 10 9) 7))))))

  (format t "~a~%"
          (solve x)))