#include <algorithm>
#include <cmath>
#include <iostream>
#include <iomanip>

using namespace std;

int M = 1000000007;

long mod_mul(long a, long b)
{
    return ((a % M) * (b % M)) % M;
}
long mod_factorial(int n)
{
    long res = 1;
    for (int i = 1; i <= n; i++)
    {
        res = mod_mul(res, i);
    }
    // cout << "fact:" << n << " " << res << endl;
    return res;
}
long mod_pow(int n, int m)
{
    if (m == 0)
        return 1;
    else if (m == 1)
        return n % M;
    else if (m % 2 == 0)
    {
        return (long)pow(mod_pow(n, m / 2), 2) % M;
    }
    return (long)mod_mul((mod_pow(n, m - 1)), n);
}

int main() {
    int n;
    cin >> n;
    cout << mod_factorial(n) << endl;
}