#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define p(s) cout<<(s)<<endl
#define REP(i,n,N) for(ll i=n;i<N;i++)
#define RREP(i,n,N) for(int i=N-1;i>=n;i--)
#define CK(n,a,b) ((a)<=(n)&&(n)<(b))
#define F first
#define S second
typedef long long ll;
using namespace std;
const ll mod = 1e12;

ll N;

int main() {
    cin>>N;
    ll a=1;
    bool flag=false;
    if(N>=50){
        printf("000000000000\n");
        return 0;
    }
    REP(i,1,N+1){
        a*=i;
        if(a>mod){
            flag=true;
        }
        a%=mod;
    }
    if(flag){
        printf("%012lld\n", a);
    }else{
        printf("%lld\n", a);
    }

    return 0;
}