//解法1:
public class Main1 {
public static void main(String[] args) {
Scanner sc=new Scanner(System.in);
int n=sc.nextInt();
int[] mul=new int[4001];
mul[0]=1;
for(int i=2;i<=n;i++){
int jinwei=0;
for(int j=0;j<mul.length;j++){
int a=mul[j]*i+jinwei;
mul[j]=a%10;
jinwei=a/10;
}
}
int flag=0;
for(int i=4000;i>=0;i--){
if(mul[i]!=0){
flag=i;
break;
}
}
for(int i=flag;i>=0;i--){
System.out.print(mul[i]);
}
}
}
//解法2:
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner cin = new Scanner(System.in);
int n = cin.nextInt();
long[] sum = new long[4000];
for (int i = 0; i < sum.length; i++)
sum[i] = 0;
sum[0] = 1;
int r = 0;
int re = 0;
for (int i = 2; i <= n; i++) {
r = 0;
for (int j = 0; j < sum.length; j++) {
re = (int) (sum[j] * i + r);
sum[j] = re % 10;
r = re / 10;
}
}
// 找出前置0和结果之间的界限
long flag = 0;
for (long i = sum.length - 1; i >= 0; i--)
if (sum[(int) i] != 0) {
flag = i;
break;
}
// 从下标flag一直输出到下标0
for (long i = flag; i > -1; i--)
System.out.print(sum[(int) i]);
}
}