import sys
import pypyjit
import itertools
import heapq
import math
from collections import deque, defaultdict
import bisect

input = sys.stdin.readline
sys.setrecursionlimit(10 ** 6)
pypyjit.set_param('max_unroll_recursion=-1')

N = int(input())
if N >= 50:
    print('0' * 12)
else:
    acc = 1
    for i in range(2, N + 1):
        acc *= i
        acc %= 10 ** 12
    if N == 20:
        print('00' + str(acc))
    elif N == 32:
        print('0' + str(acc))
    else:
        print(acc)