#include<cstdio>
#include<cstring>
#include<algorithm>
#include<string>
#include<cmath>
#include<iostream>
#include<vector>
#include<set>
#include<queue>
#include<map>
using namespace std;
typedef long long LL;
const int N=1e5+10,mod=1e6;
const int MAX = 1e8 + 10 ;
LL solve(LL n){
LL ans = 1 ;
for(LL i = 1 ; i <= n ; i++){
ans *= i ;
}
return ans ;
}
int main(){
LL n ;
while(cin >> n){
cout << solve(n)<<endl;
}
}