#include<cstdio>

#include<iostream>

#include<cstring>

#define ull unsigned long long

#define ll long long

#define R register ll

using namespace std;

#define pause (for(R i=1;i<=10000000000;++i))

#define In freopen("NOIPAK++.in","r",stdin)

#define Out freopen("out.out","w",stdout)

namespace Fread {

static char B[<<],*S=B,*D=B;

#ifndef JACK

#define getchar() (S==D&&(D=(S=B)+fread(B,1,1<<15,stdin),S==D)?EOF:*S++)

#endif

inline ll g() {

    R ret=,fix=; register char ch; while(!isdigit(ch=getchar())) fix=ch=='-'?-:fix;

    if(ch==EOF) return EOF; do ret=ret*+(ch^); while(isdigit(ch=getchar())); return ret*fix;

} inline bool isempty(const char& ch) {return (ch<=||ch>=);}

inline void gs(char* s) {

    register char ch; while(isempty(ch=getchar()));

    do *s++=ch; while(!isempty(ch=getchar()));

}

} using Fread::g; using Fread::gs;

namespace Luitaryi {

const int N=,M=1e7+;

ll n;

int len,num[N];

ll f[N][N];

inline int qpow(ll a,ll p) { R ret=; a%=M;

    for(;p;p>>=,(a*=a)%=M) if(p&) (ret*=a)%=M; return ret;

}

inline ll dfs(int l,bool ul,int c,int d) {//l:长度，ul:上界标记，c:统计1的个数，d:所求一的个数(即我们此时令sum(x)=d)

    if(!l) return c==d;

    if(!ul&&~f[l][c]) return f[l][c];

    R lim=(ul?num[l]:),cnt=;

    for(R i=;i<=lim;++i)

        cnt+=dfs(l-,ul&&i==lim,c+i,d);

    return ul?cnt:f[l][c]=cnt;

}

inline int solve(ll n) { R ans=;

    for(;n;n>>=) num[++len]=n&;

    for(R i=;i<=len;++i)

        memset(f,0xff,sizeof(f)),

        ans=(ans*qpow(i,dfs(len,true,,i)))%M;

    return ans;

}

inline void main() {

    n=g(); printf("%d\n",solve(n));

}

}

signed main() {

    Luitaryi::main(); return ;

}