Problem:
Factorial Write a program which reads an integer n and prints the factorial of n . You can assume that n ≤ 20. Input An integer n (1 ≤ n ≤ 20) in a line. Output Print the factorial of n in a line. Sample Input 5 Output for the Sample Input 120

Solution (Python):
n = int(input())

base = 1
for i in range(n):
    base *= i + 1

print(base)

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

Solution (Python):
tmp = 1
n = int(raw_input())
for i in range(1, n+1):
    tmp*=i
print tmp

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

Solution (Python):
def Factorial(n):
    if n <= 1: return 1
    return n*Factorial(n-1)
print(Factorial(int(input())))

Solution (Python):
n = input()
ans = 1
for i in xrange(0,n):
  ans *= i+1
print ans

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

Solution (Python):
def fac(x):
    if x<=1: return 1
    return fac(x-1)*x

while True:
    try:
        n=input()
        print fac(n)
    except EOFError: break

Solution (Python):



import sys
import math

for s in sys.stdin:
  d = int(s)
  print math.factorial(d)

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

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

Solution (Python):
print(["1","1","2","6","24","120","720","5040","40320","362880","3628800","39916800","479001600","6227020800","87178291200","1307674368000","20922789888000","355687428096000","6402373705728000","121645100408832000","2432902008176640000","51090942171709440000"][int(input())])

Solution (Python):
def f(x): return 1 if x<2 else x*f(x-1)
print(f(int(input())))

Solution (Python):
def func(num):
    if num<=1:
        return 1

    return num*func(num-1)

n=int(input())
print(func(n))

Solution (Python):
__author__ = 'hayato.osanai'
import sys
import math
for line in sys.stdin:
    n = int(line)
    print(math.factorial(n))
    break

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

Solution (Python):
def factorial(n):
    if n==1:
        return 1
    else:
        return n * factorial(n-1)   
    
n = int(raw_input())
print factorial(n)

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

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

print(ans)

Solution (Python):
from math import factorial
print factorial(int(raw_input()))

Solution (Python):

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

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

print fact(input())

Solution (Python):
res = 1
for i in range(int(raw_input())):
    res *= i+1
print res

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

Solution (Python):
n = int(raw_input())
answer = 1
for i in range(n):
    answer *= i+1
print answer

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

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

Solution (Python):
n = input()
ans = 1
for x in range(n):
	ans *= x + 1
print ans

Solution (Python):
def f(n):
    return f(n - 1) * n if n > 0 else 1

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

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

Solution (Python):


def main():
    n=int(input())
    count=n
    a=1

    while count!=1:
        a*=count
        count-=1

    print(a)
        
if __name__ == '__main__':
    main()

Solution (Python):
import sys
import math

n = (int)(input())
res = 1
for i in range(1,n+1):
    res *= i

print(res)

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

Solution (Python):
from math import *
PI = 3.1415926535898
while True:
	try:
		n = input()
		ans = 1
		for i in range(1, n+1):
			ans *= i
		print ans
	except EOFError:
		break

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

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

Solution (Python):
import sys

def fact(n):
    ret = 1
    if n<1:
        return -1
    elif n==1:
        return 1
    else:
        return n*fact(n-1)

line = sys.stdin.readline()
inp = int(line)
print (fact(inp))

Solution (Python):


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

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

Solution (Python):
n = input()
ans = 1
for x in xrange(2,n+1):
    ans *= x
print ans

Solution (Python):
from math import factorial

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

Solution (Python):
n=input()
a=n
while n>1:
	n-=1
	a*=n
print a

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

Solution (Python):
from math import factorial
print(factorial(int(input())))

Solution (Python):


import math
n = input()
print(math.factorial(n))

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

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

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

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

Solution (Python):
import math

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

Solution (Python):


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

print factorial(int(raw_input()))

Solution (Python):
n = int(input())
f = 1
for x in range(1, n+1):
    f *= x
print(f)

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

Solution (Python):
import operator
import functools

print(functools.reduce(operator.mul, range(1, int(input())+1)))

Solution (Python):
import math
print math.factorial(int(raw_input()))

Solution (Python):
v = (1,
     1,
     2,
     6,
     24,
     120,
     720,
     5040,
     40320,
     362880,
     3628800,
     39916800,
     479001600,
     6227020800,
     87178291200,
     1307674368000,
     20922789888000,
     355687428096000,
     6402373705728000,
     121645100408832000,
     2432902008176640000)

print(v[int(input())])

Solution (Python):
from math import factorial

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

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

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

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

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

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


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


if __name__ == '__main__':
    main()

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

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

Solution (Python):
N = int(input())

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

Solution (Python):
print reduce(lambda a,b:a*b, range(1, input()+1))

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

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

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

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

Solution (Python):
from math import factorial
print(factorial(int(input())))

Solution (Python):
n = raw_input()
a = 1
for i in range(int(n)):
    a *= i+1
print a

Solution (Python):
from math import factorial

if __name__ == '__main__':
    
    num = int(input())

    
    result = factorial(num)

    
    print(result)

Solution (Python):
def main():
    n = int(input())

    print(fact(n))

def fact(i):
    if i == 0:
        return 1

    return i * fact(i - 1)

if __name__ == '__main__':
    main()

Solution (Python):
from math import factorial
print(factorial(int(input())))

Solution (Python):


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

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

Solution (Python):
from math import factorial

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

Solution (Python):

n = int(input())
m = 1
for i in range(1,n+1):
    m = m*i

print(m)

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

Solution (Python):
n = int(raw_input())

sum=1
for i in range(n):
  sum *= (i+1)

print sum

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

Solution (Python):
array = [1]
for i in range(int(input())):
    array.append(array[i] * (i+1))
print(array.pop())

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

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

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

Solution (Python):
import sys
import math as mas

n=int(input())
a=1
for i in range(n):a*=i+1
print(a)

Solution (Python):
from functools import reduce
from operator import mul
print(reduce(mul, range(1, int(input()) + 1), 1))

Solution (Python):


import sys
import os

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

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

Solution (Python):
n = int(input())
result = n
for _ in range(n)[:1:-1] : result *= _
print(result)

Solution (Python):

import math

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

Solution (Python):
import sys
from functools import reduce
n = int(sys.stdin.readline().rstrip())
print(reduce(lambda a,b:a*b,range(1,n+1)))

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

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

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

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

Solution (Python):
n = int(input())
ans = 1

while n > 1:
	ans *= n
	n -= 1

print(ans)

Solution (Python):
from functools import reduce as R
print(R(lambda x, y: x*y, range(1, int(input())+1)))

Solution (Python):
import math

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

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

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

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

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

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

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


if __name__ == "__main__":
    main()

Solution (Python):


import sys, math, os


PYDEV = os.environ.get('PYDEV')
if PYDEV=="True":
    sys.stdin = open("sample-input.txt", "rt")


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

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

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

Solution (Python):
from math import factorial

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

Solution (Python):



if __name__ == '__main__':
    factorial = 1
    n = int(input())
    for i in range(1, n+1):
        factorial *= i
    print(factorial)

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

Solution (Python):


a=1
b=input()

for i in range(1,b+1):
	a*=i
print a,

Solution (Python):


a=1
b=input()

for i in range(1,b+1):
	a*=i
print a,

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

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

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


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

Solution (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()

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

if __name__ == '__main__':
    main()

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

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

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

Solution (Python):
n = int(raw_input())
sum= 1
for num in range(1,n+1):
    sum = sum * num
print sum

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

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

Solution (Python):
def f(x):
    if x == 1:
        return x
    else:
        return x*f(x-1)

n = int(input())
print(f(n))

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

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

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

Solution (Python):
n = int(input())
key = 1
while n:
    key *= n
    n -= 1
print(key)

Solution (Python):
kazu=int(input());
ans=kazu
for h in range(kazu-1):
    ans=ans*(h+1)
print(ans)

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

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

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

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

Solution (Python):
def kj(n):
    if n==0 or n==1:return 1
    return n*kj(n-1)
print(kj(int(input())))

Solution (Python):



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

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

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

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

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

Solution (Python):
def factorial(n):
    if n<=0:
        return 1
    else:
        return n*factorial(n-1)

print factorial(int(raw_input()))

Solution (Python):
a = input()

ans = 1
for x in range(2,a+1):
    ans = ans*x
print ans

Solution (Python):
def f(s, n):
        s *= n
        if n <= 2:
                return s
        else:
                return f(s, n-1)

n = int(raw_input())
s = 1
print f(s, n)

Solution (Python):
from math import factorial
print factorial(input())

Solution (Python):



def datasets():
    s = raw_input().strip()
    yield int(s)
    
def main():
    for n in datasets():
        print reduce(lambda a, b: a*b, range(1, n+1))
        
if __name__ == '__main__':
    main()

Solution (Python):
print reduce(lambda x,y:x*y,map(lambda x:x+1,range(int(raw_input()))))

Solution (Python):
i=input()
a=1
while i:
	a*=i;i-=1;
print a

Solution (Python):
i=input()
a=1
while i:
	a*=i
	i-=1
print a

Solution (Python):
i=input()
a=1
while i:
	a*=i;i-=1;
print a

Solution (Python):
from __future__ import (absolute_import, division, print_function,
                        unicode_literals)
from sys import stdin
from math import factorial
print(factorial(int(stdin.readline())))

Solution (Python):
n = input()
answer = 1
while n != 1:
	answer *= n
	n -= 1
print answer

Solution (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)

Solution (Python):
n = input()

ans = 1;
for i in range(1, n + 1):
  ans *= i;

print ans

Solution (Python):
n=int(raw_input())
a=1
for i in range(1,n+1):
  a*=i
print a

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

Solution (Python):

import sys


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





for line in sys.stdin:
    n = int(line)
    print fact(n)

Solution (Python):
def cal(x):
    sum = 1

    for i in range(x):
        sum *= i+1

    return sum

if __name__ == "__main__":
    a = int(raw_input())
    print cal(a)

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

n = input()
print fact(n)

Solution (Python):
n=input()

x = reduce(lambda a,b: a*b, range(1,n+1))
print x

Solution (Python):
import math

print math.factorial(int(raw_input()))

Solution (Python):


def main():
	input = raw_input()

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

def factorial(n):
	if (n <= 1):
		return 1

	return n * factorial(n - 1)

main()

Solution (Python):


import sys

lineNumber = 0


for line in sys.stdin.readlines():
    lineNumber += 1

    
    List = map(int, line.strip().split(" "))

    n = List[0]
    ans = 1
    for i in xrange(2, n+1): ans *= i
    print ans

Solution (Python):
n = int(raw_input())

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

print fact(n)

Solution (Python):
res, n = 1,int(raw_input())
while n > 0: res, n = res*n, n-1
print res

Solution (Python):
n=input()
x=1
while n: x,n=x*n,n-1
print x

Solution (Python):
import math
print math.factorial(int(raw_input()))

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

Solution (Python):
print reduce(lambda x,y:x*y,range(1,input()+1))

Solution (Python):
import sys

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

for n in sys.stdin:
  print kai(int(n))

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

Solution (Python):
print [1, 1, 2, 6, 24, 120, 720, 5040, 40320, 362880, 3628800, 39916800, 479001600, 6227020800, 87178291200, 1307674368000, 20922789888000, 355687428096000, 6402373705728000, 121645100408832000, 2432902008176640000][input()]

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

Solution (Python):
from functools import reduce
from operator import mul

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

Solution (Python):
n = int(raw_input())
ans = 1
for i in xrange(1,n+1):
    ans *= i
print ans

Solution (Python):
def fac(n):
    f = 1
    for i in range(2, n + 1):
        f *= i

    return f

n = int(input())
print(fac(n))

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

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

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

print(ans)

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

Solution (Python):

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

Solution (Python):
n = int(input())

fac = 1

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

print(fac)

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

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

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

Solution (Python):






import sys
import math


class mymath:
    
    pi = 3.14159265358979323846264338

    
    def pnum_eratosthenes(self, n):
        ptable = [0 for i in range(n+1)]
        plist = []

        for i in range(2, n+1):
            if ptable[i]==0:
                plist.append(i)
                for j in range(i+i, n+1, i):
                    ptable[j] = 1
        return plist

    def pnum_check(self, n):
        if (n==1):
            return False
        elif (n==2):
            return True
        else:
            for x in range(2,n):
                if(n % x==0):
                    return False
            return True

    
    def gcd(self, a, b):
        if b == 0:
            return a
        return self.gcd(b, a%b)

    
    def lcm(self, a, b):
        return (a*b)//self.gcd(a,b)

    
    def mul(self, A, B):
        ans = []
        for a in A:
            c = 0
            for j, row in enumerate(a):
                c += row*B[j]
            ans.append(c)
        return ans
    
    
    def is_integer(self, n):
        try:
            float(n)
        except ValueError:
            return False
        else:
            return float(n).is_integer()

    
    def dist(self, A, B):
        d = 0
        for i in range(len(A)):
            d += (A[i]-B[i])**2            
        d = d**(1/2)
        return d

    
    def abs(self, n):
        if n >= 0:
            return n
        else:
            return -n   

mymath = mymath()


class output:
    
    def list(self, l):
        l = list(l)
        
        for i, num in enumerate(l):
            print(num, end="")
            if i != len(l)-1:
                print(" ", end="")
        print()

output = output()






















def printA(A):
    N = len(A)
    for i, n in enumerate(A):
        print(n, end='')
        if i != N-1:
            print(' ', end='')
    print()










def get_input():
    N = []
    while True:
        try:
            
            
            
            N.append([int(x) for x in input().split()])
        except EOFError:
            break
    return N



n = int(input())

ans = 1

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

print(ans)

Solution (Python):
n = int(input())
ans = 1

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

Solution (Python):
n = int(input())

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

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

Solution (Python):
a = int(input())
res = 1

for i in range(a, 1, -1):
    res *= i

print(res)

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

Solution (Python):
n=int(input())
import math

print(math.factorial(n))

Solution (Python):
def fac(n):
    ans=1
    for i in range(n+1):
        if i is not 0:
            ans*=i
    return ans
n = eval(input())
print(fac(n))

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

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

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

Solution (Python):
import math
if __name__ == '__main__':

	n = int(input())

	print(math.factorial(n))

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Solution (Python):




import math

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

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

Solution (Python):
n = int(input())
k = 1
for j in range(1,n+1):
    k *= j
print(k)

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

Solution (Python):
print reduce(lambda a, b: a*b, range(1, input()+1))

Solution (Python):
n = int(input())

ans = 1

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

print(ans)

Solution (Python):
n = int(input())

def fact(n):
   ans = 1
   for n in range(n,1,-1):
      ans *= n
   return ans

print(fact(n))

Solution (Python):
import math

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

Solution (Python):




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


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

Solution (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)

Solution (Python):
print([0,1,2,6,24,120,720,5040,40320,362880,3628800,39916800,479001600,6227020800,87178291200,1307674368000,20922789888000,355687428096000,6402373705728000,121645100408832000,2432902008176640000][int(input())])

Solution (Python):
import math

def run():
    n = int(input())
    print(math.factorial(n))

if __name__ == '__main__':
    run()

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

Solution (Python):

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