#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(int)(n);i++)
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;}
using ll = long long;
const ll mod=1e12;

ll n;
ll dp[105];

int main () {
  cin >> n;
  dp[0]=1;
  for(int i=1;i<100;i++) dp[i]=(dp[i-1]*i)%mod;
  if(n<15) cout << dp[n] << endl;
  else printf("%012lld\n", dp[n<100 ? n : 100]);
}