#include <stdio.h>

const int Mod = 1000000007;
int div[100001][300] = {};
long long memo[100001];

long long recursion(int M)
{
	if (memo[M] >= 0) return memo[M];
	else memo[M] = 0;

	int i;
	for (i = 0; div[M][i] > 0; i++) memo[M] += recursion((M - div[M][i]) / div[M][i]);
	memo[M] %= Mod;
	return memo[M];
}

int main()
{
	int M;
	scanf("%d", &M);
	
	int i, k, l[100001] = {};
	long long ans = 0;
	for (i = 1; i <= M; i++) for (k = i; k <= M; k += i) div[k][l[k]++] = i;
	for (k = 1, memo[0] = 1; k <= M; k++) memo[k] = -1;
	for (i = 0; div[M][i] > 0; i++) ans += recursion((M - div[M][i]) / div[M][i]);
	printf("%lld\n", ans % Mod);
	fflush(stdout);
	return 0;
}