import java.util.ArrayList;
import java.util.Arrays;
import java.util.HashSet;
import java.util.List;
import java.util.Scanner;

class Main {
	public static void main(String[] args) throws Exception {
		new Main().run();
	}
	
	final long MOD=(long)1e9+7;
	
	long pow(long a,long n) {
		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+1];//dp[i][j]:=i個使用済み,p^jまで見た。
		dp[0][0]=1;
		for(int i=0;i<e;++i) {
			for(int j=0;j<=e;++j) {
				if(dp[i][j]==0)continue;
				for(int k=j+1;k<=e;++k) {
					for(int l=1;l<=e;++l) {
						if(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))*pow(p,i)%MOD;
							add%=MOD;
						}
						dp[i+k*l][k]+=inv(add)*dp[i][j]%MOD;
						dp[i+k*l][k]%=MOD;
					}
				}
			}
		}
		long ret=0;
		for(int i=1;i<=e;++i)ret=(ret+dp[e][i])%MOD;
		ret=(ret%MOD+MOD)%MOD;
		return ret;
	}
	
	void run() {
		Scanner sc=new Scanner(System.in);
		int M=sc.nextInt();
		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));
	}
	
}