#include<bits/stdc++.h>
using namespace std;
#define ll long long
const int mod=1e9+7;
const int maxn=1005;
const int maxm=5e6+5;
int cnt,tot,id[maxn][maxn],cnt1,SS[maxm];
long long n,nn,f[maxm],g[maxm],ans,a[maxm],num[maxm];
vector<pair<int,int> >p,q;
vector<int>to[maxm];
map<pair<int,int>,int>mp;
signed main(){
	cin>>n;
	nn=n;
	for(int i=2;1ll*i*i<=n;i++){
		if((n%i)==0){
			num[++cnt]=i;
			while((n%i)==0){
				n/=i;
			}
		}
	}
	if(n>1)num[++cnt]=n;
	n=nn;
	for(ll i=1;1ll*i*i<=n;i++){
		if((n%i)==0){
//			cout<<"ppp"<<endl;
			if(i!=1)a[++cnt1]=i;
			if(1ll*i*i!=n)a[++cnt1]=n/i;
		}
	}
//	cout<<cnt1<<" "<<cnt<<endl;
//	cout<<"hhh"<<endl;
	for(int i=1;i<=cnt1;i++){
		for(int j=1;j<=cnt;j++){
			if((a[i]%num[j])==0)to[i].push_back(j-1),SS[i]|=(1<<(j-1));
		}
	}
	for(int i=0;i<=cnt-1;i++){
		for(int j=0;j<=cnt-1;j++){
			if(id[j][i])id[i][j]=id[j][i];
			else id[i][j]=++tot;
		}
	}
	q.push_back(make_pair(0,0));
	f[0]=1;
	int cnt2=0;
	for(int i=1;i<=cnt*2+1;i++){
		tot=-1;
		for(int j=0;j<q.size();j++){
			cnt2++;
			int S=q[j].first;
			int T=q[j].second;
			ans=(ans+f[j])%mod;
			for(int k=1;k<=cnt1;k++){
				bool flag=false;
				for(int xx=0;xx<=to[k].size()-1;xx++){
					for(int yy=xx;yy<=to[k].size()-1;yy++){
						if(T&(1<<id[to[k][xx]][to[k][yy]])){
							flag=true;
							break;
						}
					}
					if(flag)break;
				}
				if(flag)continue;
				int NT=T;
				for(int xx=0;xx<=to[k].size()-1;xx++){
					for(int yy=0;yy<=cnt-1;yy++){
						if((S&(1<<yy))){
							NT|=(1<<id[to[k][xx]][yy]);
						}
					}
				}
				pair<int,int>pp=make_pair(S|SS[k],NT);
				if(mp.find(pp)==mp.end())mp[pp]=++tot,p.push_back(pp),g[tot]=f[j];
				else{
					g[mp[pp]]=g[mp[pp]]+f[j];
					if(g[mp[pp]]>mod)g[mp[pp]]-=mod;
				} 
			}
		}
		swap(f,g);
		memset(g,0,sizeof g);
		swap(p,q);
		p.clear();
		mp.clear();
	}
	cout<<ans-1<<endl;
//	cout<<cnt2<<endl;
	return 0;
}