#include #define rep(i,n) for(ll i=0;i<(ll)(n);i++) using namespace std; using ll = long long ; using P = pair ; using pll = pair; constexpr int INF = 1e9; constexpr long long LINF = 1e17; constexpr ll MOD = 1e12; constexpr double PI = 3.14159265358979323846; int main(){ ll n; cin >> n; if(n > 100){ cout << "000000000000" << endl; return 0; } vector dp(n+1,0); dp[0] = 1; for(ll i=1;i<=n;i++){ dp[i] = (dp[i-1] * i) % MOD; } if(n <= 14) cout << dp[n] << endl; else printf("%012lld\n",dp[n]); return 0; }