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

#include <atcoder/modint>
using mint = atcoder::modint1000000007;

using ll = long long;
using vl = vector<ll>;

ll floor_sqrt(ll n) {
	ll l = 0, r = 1e9;
	while (r - l > 1) {
		ll x = (l + r) / 2;
		(x * x <= n ? l : r) = x;
	}
	return l;
}

pair<vl, vl> prime_count(ll n) {
	ll sq = floor_sqrt(n);
	vl x, c;
	for (ll i = 1; i <= sq; i++) x.push_back(n / i);
	for (ll i = x.back() - 1; i; i--) x.push_back(i);
	unordered_map<ll, ll> s;
	for (auto i : x) s[i] = i - 1;
	for (ll p = 2; p <= sq; p++) {
		if (s[p] <= s[p - 1]) continue;
		ll t = s[p - 1];
		for (auto i : x) {
			if (i < p * p) break;
			s[i] -= s[i / p] - t;
		}
	}
	reverse(x.begin(), x.end());
	for (auto i : x) c.push_back(s[i]);
	return {x, c};
}

int main() {
	ll n;
	cin >> n;
	auto [x, c] = prime_count(n);
	mint ans = 1;
	for (int i = 1; i < x.size(); i++) {
		mint s = 1;
		for (ll v = n; v;) s += v /= x[i];
		ans *= s.pow(c[i] - c[i - 1]);
	}
	cout << ans.val() << "\n";
}