#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> l_l;
typedef pair<int, int> i_i;

#define fi first
#define se second
// #define rep(i,n) for(int i = 0; i < (n); ++i)
// #define rrep(i,n) for(int i = 1; i <= (n); ++i)
// #define drep(i,n) for(int i = (n)-1; i >= 0; --i)
// #define srep(i,s,t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(),a.end()
#define chmax(x,y) (x = max(x,y))
#define chmin(x,y) (x = min(x,y))
// #define limit(x,l,r) max(l,min(x,r))
// #define lims(x,l,r) (x = max(l,min(x,r)))
// #define isin(x,l,r) ((l) <= (x) && (x) < (r))
// #define pb push_back
// #define sz(x) (int)(x).size()
// #define pcnt __builtin_popcountll
// #define uni(x) x.erase(unique(rng(x)),x.end())
// #define snuke srand((unsigned)clock()+(unsigned)time(NULL));
// #define show(x) cout<<#x<<" = "<<x<<endl;
// #define PQ(T) priority_queue<T,v(T),greater<T> >
// #define bn(x) ((1<<x)-1)
// #define dup(x,y) (((x)+(y)-1)/(y))
// #define newline puts("")
// #define v(T) vector<T>
// #define vv(T) v(v(T))
#define v(T) vector<T>

const double PI = 3.14159265358979323846;
const double EPS = 1e-12;
const ll INF = 0x1fffffffffffffff; // or 0x7fffffffffff
const ll MOD = 1e9+7;
const ll MOD2 = 998244353;

#define rep(i, a, b) for(ll (i) = (a); (i) < (b);++i)

// 逆順になる reverse(rng(ans));
// vector<ll> G[100000];
// cout << fixed << setprecision(15) << y << endl;
// cout << bitset<20>(i) << endl;
// fill(distance[0], distance[row], INF);
// __builtin_popcount()
// stoi(S[j], 0, 2)
// for (ll i = 0;i < (ll)s.size() - k;i++)
// ll dp[桁数][未満フラグ][条件を満たしているか]
// stoi stoll
// bit全探索 n進数全探索
// while (t > 0) cc += t % 9, t /= 9;
// priority_queue<ll> que; que.push(3); que.top(); que.pop();
// rep(i,C)rep(j,C) if(i != j) rep(k,C) if(i != k && j != k)
// 始点終点をデータに含ませる
// memory restriction RE -> CE
// forr 逆順ループsnippet
// 座標 上下の回数さえ分かれば組合せ問題

long long gcd(long long a, long long b) {
	if (b) return gcd(b, a % b);
	return a;
}
long long lcm(long long a, long long b) {
	return a * b / gcd(a, b);
}
long long extgcd(long long a, long long b, long long &x, long long &y) {
	long long g = a; x = 1; y = 0;
	if (b) {
		g = extgcd(b, a % b, y, x);
		y -= a / b * x;
	}
	return g;
}
long long invmod(long long a, long long mod) {
	long long x, y;
	extgcd(a, mod, x, y);
	x %= mod;
	if (x < 0) x += mod;
	return x;
}
long long powmod(long long e, long long x, long long mod) {
	long long prod = 1;
	long long cur = e;
	while(x > 0) {
		if (x & 1) prod = prod * cur % mod;
		cur = cur * cur % mod;
		x <<= 1;
	}
	return prod;
}
vector<int> primes(MOD/64);
vector<int> eratosthenes(long long n) {
	for (long long i = 2;i < n;++i) primes[i] = i;
	for (long long i = 2;i*i < n;++i) {
		if (primes[i])
			for (long long j = i*i; j < n; j+=i)
				primes[j] = 0;
	}
	auto p = remove(primes.begin(), primes.end(), 0);
	primes.erase(p, primes.end());
	return primes;
}
long long fac(long long n, long long mod) {
	if (n >= mod) return 0;
	if (n) return (n * fac(n-1, mod)) % mod;
	return 1;
}
long long combination(long long n, long long k, long long mod) {
	// 階乗やその逆元をメモ化すると速い
	// でかいやつはnCk/2^Nをパスカルの三角形で作る
	long long res = fac(n, mod);
	res = (res * invmod(fac(k, mod), mod)) % mod;
	res = (res * invmod(fac(n-k, mod), mod)) % mod;
	return res;
}

int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);

	ll N;
	cin >> N;
	eratosthenes(N);
	cout << fac(N, MOD) << endl;
	return 0;
}