#include<iostream>
#include<algorithm>
#include<vector>
#include<string>
#include<utility>
#include<map>
#include<set>
#include<queue>
#include<stack>
#include<functional>
#include<math.h>
#include<random>
#include <bitset>
using namespace std;
#define N (1000000000+7)
//#define N 998244353
#define INF 1e16
typedef long long ll;
typedef pair<int,int> P;
typedef pair<int,P> Q;

const int inf = (int)1e9; 

ll gcd(ll a, ll b) {
	if (b > a) {
		ll tmp = b;
		b = a;
		a = tmp;
	}
	if (a%b == 0)return b;
	else return gcd(b, a%b);
}

ll inv(ll x,ll power) {
	ll res = 1;
	ll k = power;
	ll y = x%N;
	while (k) {
		if (k & 1)res = (res*y) % N;
		y = (y%N*y%N) % N;
		k /= 2;
	}
	return res;
}

ll inv1(ll x,ll power) {
	ll res = 1;
	ll k = power;
	ll y = x%(N-1);
	while (k) {
		if (k & 1)res = (res*y) % (N-1);
		y = ((y%(N-1))*(y%(N-1))) % (N-1);
		k /= 2;
	}
	return res;
}

const ll m = 1000000000000;

int main(void){
	ll n;
	cin>>n;
	if(n>=50){
		cout<<"000000000000"<<endl;
	}
	else{
		ll ans = 1;
		for(ll i=1;i<=n;i++){
			ans*=i;
			ans = ans%m;
		}
		ll t = ans;
		ll d = 0;
		while(t>=10){
			t/=10;
			d++;
		}
		d++;
		if(n<=14 || d==12)cout<<ans<<endl;
		else{
			for(ll i=0;i<12-d;i++)cout<<"0";
			cout<<ans<<endl;
		}
	}
	return 0;
}