#include <iostream>
#include <fstream>
#include <cstdio>
#include <cmath>
#include <vector>
#include <cstring>
#include <string>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <algorithm>
using namespace std;

#define REP(i,n) for(int i=0; i<n; ++i)
#define FOR(i,a,b) for(int i=a; i<=b; ++i)
#define FORR(i,a,b) for (int i=a; i>=b; --i)
#define ALL(c) (c).begin(), (c).end()

typedef long long ll;
typedef vector<int> VI;
typedef vector<ll> VL;
typedef vector<VI> VVI;
typedef pair<int,int> P;
typedef pair<ll,ll> PL;

ll m = 1e12;

int main() {
    ll n;
    cin >> n;
    if (n > 100){
        cout << "000000000000" << endl;
        return 0;
    }
    ll ans = 1;
    FOR(i,1,n){
        ans = (ans * i) % m;
    }
    if (ans < m){
        cout << ans << endl;
        return 0;
    }
    printf("%012lld", ans);

    return 0;
}