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

#define ll long long
#define debug(x) cerr << fixed << #x << " is " << x << endl;

const int MAX = 10000;
const int MOD = 1000000007;
vector<int> primes;

int E(int n, int p)
{
	int sum = 0;
	for(int i = p; n / i != 0; i *= p)
		sum += n / i;
	return sum;
}

void crivo()
{
	bitset<MAX+1> sieve;
	sieve.set();
	for(int i = 2; i < MAX; i++)
	{
		if(sieve[i])
		{
			primes.push_back(i);
			for(int j = 2*i; j < MAX; j += i)
				sieve[j] = 0;
		}
	}
}


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

	crivo();
	int n, ans = 1;
	cin >> n;
	for(auto i : primes)
	{
		if(i > n)
			break;
		ans = (ll) ans * (E(n, i) + 1) % MOD;
	}
	cout << ans << endl;

	return 0;
}
