#include <iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<iomanip>
#include<map>
#include<stack>
#include<queue>
#include<set>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define req(i,n) for(int i = 1;i <=  n; i++)
#define rrep(i,n) for(ll i = n-1;i >= 0;i--)
#define ALL(obj) begin(obj), end(obj)
#define RALL(a) rbegin(a),rend(a)
typedef long long ll;
typedef long double ld;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
const ll INF = 1e18;
ll mod = 1e9 + 7;
int main() {
	ll n; cin >> n; ll ans = 1;
	if (n <= 14) {
		req(i, n) ans *= i;
		cout << ans << endl;
	}
	else if (n < 50) {
		req(i, n) {
			ans *= i;
			ans %= 1000000000000;
		}if (n == 32) cout << 0;
		else if (n == 20) cout << "00";
		cout << ans << endl;
	}
	else {
		rep(i, 12) cout << 0;
		cout << endl;
	}
}