#include using namespace std; using ll = long long; template using vt = vector; template using vvt = vector>; template using ttt = tuple; using tii = tuple; using vi = vector; #define rep(i,n) for(int i=0;i<(int)(n);i++) #define pb push_back #define mt make_tuple #define ALL(a) (a).begin(),(a).end() #define FST first #define SEC second #define DEB cerr<<"!"<0){if((n&1)==1)r=r*x%m;x=x*x%m;n>>=1;}return r%m;} inline ll lcm(ll d1, ll d2){return d1 / __gcd(d1, d2) * d2;} /* Coding space */ int main(){ ll n; cin >> n; ll ans = 1; int flag = 0; while(n != 0){ if(ans == 0 || n >= 100){ cout << "000000000000" << endl; return 0; } ans *= n; if(ans >= 1000000000000){ ans %= 1000000000000; flag++; } n--; } if(flag) cout <