#include <iostream>
#include <algorithm>
#include <functional>
#include <string>
#include <climits>
#include <vector>
#include <numeric>
#include <complex>
#include <map>
#include <bitset>
#include <stack>
#include <queue>
#include <set>
using namespace std;

//#define __int64 long long
#define REP(i,a,b) for(int i=a;i<b;i++)
#define rep(i,n) REP(i,0,n)
const int Vec = 4;
const int Vecy[Vec] = {0,-1,0,1};
const int Vecx[Vec] = {1,0,-1,0};
const int Modd = 1000000007;

string convert(long long num){
	string res = "000000000000";
	int i = 0;
	while(num > 0){
		res[11-i] = '0' + num % 10;
		num /= 10;
		i++;
	}
	
	return res;
}

int main(){
	long long ans = 1;
	long long n;
	bool flg = false;
	
	cin >> n;
	
	for(long long i=1; i<=n; i++){
		ans *= i;
		if(ans >= (long long)1000000000000){
			flg = true;
			ans %= (long long)1000000000000;
		}
		if(ans % (long long)1000000000000 == 0){
			cout << "000000000000" << endl;
			return 0;
		}
	}
	
	if(flg){
		cout << convert(ans) << endl;
	}else{
		cout << ans << endl;
	}
	
    return 0;
}