数组别太小，注意取模的数

#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int,int>;
#define int long long
const int N = 1e5+10;
const int inf = 0x3f3f3f3f;
const int mod = 1e7+7;
int gcd(int a,int b){return b?gcd(b,a%b):a;}
int lcm(int a,int b){return a*b/gcd(a,b);}
int qmi(int a,int b,int mod){int res=1;while(b){if(b&1)res=res*a%mod;b>>=1;a=a*a%mod;}return res;}
 
 
int n,q,m;
 
int dp[105][65];
int num1;
int a[N];
 
int dfs(int len,int s,int limit){
	if(!len)return s==num1;
	if(!limit&&~dp[len][s])return dp[len][s];
	int up = limit?a[len]:1;
	int res = 0;
	for(int i=0;i<=up;++i){
		res+=dfs(len-1,s+i,limit&&i==up);
	}
	
	if(!limit)return dp[len][s] = res;
	return res;
}
 
 
 
int cal(int x){
 	memset(dp,-1,sizeof dp);
	int len = 0;
	while(x){a[++len] = x%2;x/=2;}
	
	return dfs(len,0,1);
	
}
 
void solve()
{
	
	cin>>n;
	
	int reu = 1;
	for(int i=1;i<=55;++i){
		num1 = i;
		int t = cal(n);
		reu = reu*qmi(num1,t,mod)%mod;
		
	}
	
	cout<<reu%mod;
	
	

	

	
	
 
}
 
signed main()
{
	ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
	int _;
	//cin>>_;
	_ = 1;
	while(_--)solve();
	return 0;
}