#include<iostream>

 #include<cstdio>

 #include<cstdlib>

 #include<cmath>

 #include<cstring>

 #include<algorithm>

 #define mod 10000007

 #define LL long long

 using namespace std;

 LL c[][];

 void pre() {

     for(int i=;i<=;i++) c[i][]=;

     for(int i=;i<=;i++) for(int j=;j<=i;j++) c[i][j]=c[i-][j]+c[i-][j-];

 }

 LL w[];

 LL n,len;

 LL power(LL a,LL b) {

     LL ans=;

     while(b) {

         if(b&) ans*=a,ans%=mod;

         a*=a;a%=mod;

         b>>=;

     }

     return ans;

 }

 LL cnt(LL x) {

     LL ans=;

     for(int i=len;i>=;i--) {

         if(w[i]) ans+=c[i-][x],x--;

         if(x<) break;

     }

     return ans;

 }

 int main() {

     pre();

     scanf("%lld",&n);

     n++;

     while(n) {

         w[++len]=n&;

         n>>=;

     }

     LL ans=1LL;

     for(int i=;i<=len;i++) ans*=power(i,cnt(i)),ans%=mod;

     printf("%lld",ans);

 }