#include <cmath>
#include <cstdio>
#include <iostream>

#define maxn 10000000
#define mod 1000000007

using namespace std;

int cnt;
int c[maxn];
long long n;
long long ans;

void count(long long n){
	for(long long i=2;i<=n;i++)if(n%i==0){
		cnt++;
		while(n%i==0)n/=i,c[cnt]++;
	}
}

int main(){
	freopen("lancer.in","r",stdin);
	freopen("lancer.out","w",stdout);
	cin>>n;
	count(n);
	ans=1;
	for(int i=1;i<=cnt;i++)
		ans=(ans*(1ll*c[i]+1)*(1ll*c[i]+2)/2)%mod;
	cout<<ans<<'\n';
	return 0;
}