#include<iostream>
#include<cstring>
#include<algorithm>
using namespace std;
const int N = 1E6+10,mod = 1e9+7;
int f[N];
int main(){
	int n;
	scanf("%d",&n);
	f[0]=1;
	for(int i=1;i<=n;i++){
		for(int j=1;j*j<=i;j++){
			if(i%j==0){
				f[i]+=f[i/j-1];
				if(j*j!=i)
				f[i]+=f[j-1];
				f[i]%=mod; 
			}
		}
	}
	cout<<f[n];
	return 0;
}