#include <cstdio>
const int MOD = 1000000007;
const int MAXN = 1000000 + 10;
bool notp[MAXN];
int main() {
int i, j;
int n, cnt, x, ans = 1;
scanf("%d", &n);
for (i = 2; i <= n; i++) {
if (!notp[i]) {
for (j = i * 2; j <= n; j += i)
notp[j] = true;
cnt = 0;
for (x = n / i; x; x /= i)
cnt += x;
ans = ans * (2ll * cnt + 1) % MOD;
}
}
printf("%d\n", ans);
return 0;
}
一本通1624:樱花
最新推荐文章于 2025-07-23 11:59:44 发布