#include<bits/stdc++.h>
#define MAX_N 100001
#define INF_INT 2147483647
#define INF_LL 9223372036854775807
#define REP(i,n) for(int i=0;i<(int)(n);i++)
using namespace std;
typedef long long int ll;
typedef pair<ll,ll> P;
void init(int n);
int find(int n);
void unite(int x,int y);
bool same(int x, int y);
ll bpow(ll,ll,ll);
typedef vector<int> vec;
typedef vector<vec> mat;
mat mul(mat &A,mat &B);
mat pow(mat A,ll n);
int dx[4] = {1,0,0,-1};
int dy[4] = {0,1,-1,0};


bool cmp_P(const P &a,const P &b){
  return a.second < b.second;
}

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

ll bpow(ll a, ll n,ll mod){
  int i = 0;
  ll res=1;
  while(n){
    if(n & 1)
      res = (res*a) % mod;
    a = (a*a) % mod;
    n >>= 1;
  }
  return res;
}

int main()
{
  ll N=10E11,n2=0,n5=0;
  cin >> N;
  ll D = N;
  ll d = 2;
  while(d <= N){
    n2 += N/d;
    d *= 2;
  }
  d = 5;
  while(d <= N){
    n5 += N/d;
    d *= 5;
  }
    
  if(n2 >= 12 && n5 >= 12){
    cout << "000000000000" << endl;
  }else{
    ll res = 1;
    bool f=0;
    for(int i=1;i<=N;i++){
      if(res*i >= 1000000000000)
        f=1;
      res = (res*i)%1000000000000;
    }
    if(f)
      printf("%012lld\n",res);
    cout << res << endl;
  }
 
  return 0;
}