import java.util.Arrays;
import java.util.Scanner;

class Main {
	public static void main(String[] args) throws Exception {
		Scanner sc=new Scanner(System.in);
		int M=sc.nextInt();
		new Main().run(M);
	}
	
	final long MOD=(long)1e9+7;
	
	long pow(long a,long n) {
		n%=MOD-1;
		long ret=1;
		for(;n>0;n>>=1,a=a*a%MOD)if(n%2==1)ret=ret*a%MOD;
		return ret;
	}
	
	long inv(long a) {
		return pow(a,MOD-2);
	}
	
	long solve(long p,int e) {
		long[][][] dp=new long[e+1][e+2][e+1];//dp[i][j][k]:=p^i使用済み,p^jまで見た,k要素決定。
		dp[0][e+1][0]=1;
		for(int i=0;i<e;++i) {
			for(int j=e+1;j>=1;--j) {
				for(int n=0;n<e;++n) {
				if(dp[i][j][n]==0)continue;
					for(int k=j-1;k>=1;--k) {
						for(int l=1;l<=e;++l) {
							if(i+k*l>e||(k==1&&i+k*l!=e))continue;
							//(Z/p^k)^l
							long add=1;
							for(int m=0;m<l;++m) {
								add*=(pow(p,k*l)-pow(p,l*(k-1)+m))%MOD*pow(p,k*n*(l-1)+i)%MOD;
								add%=MOD;
							}
							//System.out.println("add="+add+" (Z/"+p+"^"+k+"Z)^"+l);
							dp[i+k*l][k][n+l]+=inv(add)*dp[i][j][n]%MOD;
							dp[i+k*l][k][n+l]%=MOD;
						}
					}
				}
			}
		}
		long ret=0;
		for(int i=1;i<=e;++i)for(int j=1;j<=e;++j)ret=(ret+dp[e][i][j])%MOD;
		ret=(ret%MOD+MOD)%MOD;
		return ret;
	}
	
	void run(int M_) {
		int M=M_;
		long fac=1;
		for(long i=1;i<=M;++i)fac=fac*i%MOD;
		long ans=1;
		for(long div=2;div<=M;++div) {
			int e=0;
			while(M%div==0) {
				M/=div;
				++e;
			}
			if(e>0) ans=ans*solve(div,e)%MOD;
		}
		ans=ans*fac%MOD;
		System.out.println(ans);
	}
	
	static void tr(Object... objects) {
		System.out.println(Arrays.deepToString(objects));
	}
	
}