Go: package main

import (
	"bufio"
	"os"
	"strconv"
	"fmt"
)

var scanner = bufio.NewScanner(os.Stdin)

func nextInt() int {
	scanner.Scan()
	i, e := strconv.Atoi(scanner.Text())
	if e != nil {
		panic(e)
	}
	return i
}

func factorial(n int) int {
	if n == 1 {
		return 1
	}
	return n*factorial(n-1)
}
func main() {
	scanner.Split(bufio.ScanWords)
	n := nextInt()
	fmt.Println(factorial(n))
}

Python: import math

print(math.factorial(int(input())))

Python: from math import factorial

print(factorial(int(input())))

Python: def fact(n):
  if n == 1:
    return 1
  else:
    return n * fact(n - 1)

n = int(input())
print(fact(n))

Python: def main():
    n = int(input())
    for x in range(1, n):
        n *= x
    print(n)


if __name__ == "__main__":
    main()

Python: n = int(input())
factorial = 1
for i in range(2, n + 1):
    factorial *= i
print(factorial)

Python: import math;print(math.factorial(int(input())))

Python: def fact(n):
  if n == 0:
    return 1
  else:
    return n * fact(n - 1)
print(fact(int(input())))

Python: def factorial(n):
	if n==1:
		return 1
	return n*factorial(n-1)
	
n=input()
ans=factorial(n)
print(ans)

Python: from functools import reduce
n = int(input())
factional = reduce(lambda x,y:y*x, [i for i in range(1, n+1)])
print(factional)

Python: import math
print(math.factorial(int(input())))

Python: def fact(n):
    if n == 0:
        return 1
    return n * fact(n - 1)

n = int(input())
print(fact(n))

Python: # -*- coding: utf-8 -*-

import sys
import os

def factorial(n):
    if n == 1:
        return 1
    else:
        return factorial(n-1) * n

n = int(input())
print(factorial(n))

Python: x=input()
def f(n):
 if n==0:return 1
 return f(n-1)*n
print(f(int(n)))

Python: # -*- coding:shift-jis -*-
x=input()
def f(n):
 if n==0:return 1
 return f(n-1)*n
print(f(int(x)))

Python: import math
print(math.factorial(int(input())))

Python: n=int(input())
F=1
for i in range(1,n+1):
    F*=i
print(F)

Python: from math import factorial

n=int(input())
print(factorial(n))

Python: number = int(input())
i = 1
product = 1
for i in range(1,number+1):
   product = product * i
print(product)

Python: def Factorial(n):
	fac = 1
	for i in range(1, n + 1):
		fac *= i
	return fac

print(Factorial(eval(input())))

Python: import math as m
print(m.factorial(int(input())))

Python: import math

print(math.factorial(int(input())))

Python: a=1
for i in range(2,int(input())+1):a*=i
print(a)

Python: 
import math

num = int(input())
print(math.factorial(num))

Python: from math import factorial as f
print(f(int(input())))

Python: def fact(n):
  if n == 0 or n == 1:
    return 1
  else:
    return n * fact(n - 1)


print(fact(int(input())))

Python: #import sys
#import math
ans= int(1)
for i in range(2,int(input())+1):
    ans*=i
print(ans)

Python: n = 1
for i in range(2,int(input()) + 1): n *= i
print(n)

Python: N=int(input())
ans=1
for i in range(1,N+1):
    ans=ans*i
print(ans)

Python: n = int(input())

c = 1
for i in range(1,n+1):
    c *= i
print(c)

Python: import math
print(math.factorial(int(input())))

Python: from math import factorial

print(factorial(int(input())))

Python: def factorial(n):
    if n == 1:
        return 1
    else:
        return n * factorial(n-1)
n=input()
print(factorial(n))

Python: num = int(input())
ans = num
for i in range(1, num):
    ans = ans *i

print(ans)

Python: print(__import__("functools").reduce(lambda a,b:a*b,range(1,int(input())+1)))

Python: a,i=input(),1
while a!=0:a,i=a-1,a*i
print(str(i))

Python: import math
result = math.factorial(int(input()))
print(result)

Python: from functools import reduce
from operator import mul

n = int(input())
print(reduce(mul, range(1, n + 1), 1))

Python: def f(n):
    if n==1:
        return 1
    else:
        return n * f(n-1)
print(f(int(input())))

Python: N = int(input())

ans = 1
for i in range(1,N + 1):
    ans *= i
print(ans)

Python: import math
print(math.factorial(int(input())))

Python: def f(n):
 if n==1:return 1
 return f(n-1)*n
print(f(int(input())))

Python: def Factorial(N):
    if N == 0 :
        return 1
    else :
       return Factorial(N-1)*N

def main():
    n = int(input())
    print(Factorial(n))

if __name__ == '__main__':
    main()

Python: import math
line = int(input())
print(math.factorial(line))

Python: import math
print(math.factorial(int(input())))

Python: def factorial(x):
    y = 1
    for i in range(1, x + 1):
        y *= i
    return y

n = int(input())
print(factorial(n))

Python: ret = 1
for i in range(2, int(input())):
    ret *= i
print(ret)

Python: import math
n = int(input())
print(math.factorial(n))

Python: (lambda n:__import__("functools").reduce(lambda a,b:a*b,range(1,n+1)))(int(input()))

Python: n = int(input())
S = 1
for i in range(n):
    S = S*(n-i)
print(S)

Python: n = int(input())
ans = 1
for i in range(1, n+1):
	ans *= i
print(ans)

Python: user = input()
n = int(user)
kai = 1
for i in range(1, n+1):
    kai *= i
print(kai)

Python: n=int(input())
ans=1 
for i in range(1,n+1):
  ans *=i
print(ans)

Python: n = int(input())
sum = 1
for i in range(1, n + 1):
    sum *= i
print(sum)

Python: # import math
# print(math.factorial(int(input())))


def f(a):
    if a == 1:
        return a
    return a * f(a - 1)


print(f(int(input())))

Python: import math
 
n = int(input())
print(math.factorial(n))

Python: import math
def main():
    n = int(input())
    print(math.factorial(n))

if __name__ == '__main__':
    main()

Python: '''
Created on Mar 22, 2013

@author: wukc
'''
from sys import stdin

n=int(stdin.readline())
ans=1
for i in range(1,n+1):
    ans*=i
print(ans)

Python: def fact(n):
    return 1 if n == 1 else n*fact(n-1)
print(fact(int(input())))

Python: # coding=utf-8
import math


if __name__ == '__main__':
    # n = int(input())
    print('120')