#include <bits/stdc++.h>
using namespace std;

long long gcd(long long x, long long y)
{
    if (y == 0)
        return x;
    return gcd(y, x % y);
}

long long lcm(long long x, long long y)
{
    if (x == 0 || y == 0)
        return 0;
    return x / gcd(x, y) * y;
}

int main()
{
    long mod = 1000000000000;
    int N;
    cin >> N;
    long ans = 1;
    for (long i = 2; i <= N; i++)
    {
        ans = (ans * i) % mod;
    }
    cout << ans << endl;
}