#include <algorithm>
#include <iostream>
#include <vector>
#include <iomanip>
using namespace std;
using ll = long long;
const ll MOD = 1e12;

int main() {
    int n; cin >> n;
    ll fact = 1;
    bool is_overflowed = false;
    for (int i = 1; fact && i <= n; i++) {
        if (fact * i >= MOD) is_overflowed = true;
        (fact *= i) %= MOD;
    }
    if (is_overflowed) {
        printf("%012lld\n", fact);
    } else {
        cout << fact << endl;
    }
    return 0;
}