#include <bits/stdc++.h>

using namespace std;

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

#define dec(i, a, b)	for (int i(a); i >= (b); --i)

typedef long long LL;

const int N  =  6170736;

const int M  = 100000002;

const LL mod = 100000007;

int n, pn;

int p[N];

bitset <M> c;

LL ans = 1LL;

int v;

int main(){

	scanf("%d", &n);

	pn = 0;

	rep(i, 2, n){

		if (!c[i]){

			p[++pn] = i;

			for (LL s = i; s <= n; s *= i)

				ans = ans * i % mod;

		}

		rep(j, 1, pn){

			v = i * p[j];

			if (v > n) break;

			c[v] = 1;

			if (i % p[j] == 0) break;

		}

	}

	printf("%lld\n", ans);

	return 0;

}