#ifdef MYEE
#pragma GCC optimize("-O2")
#endif

#include <bits/stdc++.h>
using uint = unsigned;
using ullt = unsigned long long;
const ullt Mod=1e9+7;
struct modint{
    ullt v;
    modint():v(0){}
    modint(ullt v):v(v%Mod){}
    ullt&operator()(){return v;}
    friend modint operator+(modint a,modint b){return a()+b();}
    friend modint operator-(modint a,modint b){return a()+Mod-b();}
    friend modint operator*(modint a,modint b){return a()*b();}
    friend modint operator^(modint a,ullt b){
        modint ans(1);
        while(b){
            if(b&1)ans*=a;
            a*=a,b>>=1;
        }
        return ans;
    }
    modint inv(){return*this^(Mod-2);}
    modint operator+=(modint b){return*this=*this+b;}
    modint operator-=(modint b){return*this=*this-b;}
    modint operator*=(modint b){return*this=*this*b;}
    void println(){printf("%llu\n",v);}
};
modint P[20000005],Q[20000005];
modint Dp[1u<<20|1],Last[1u<<20|1];
int main(){
#ifdef MYEE
    freopen("QAQ.in","r",stdin);
#endif
    P[0]=1;for(uint i=1;i<=20000000;i++)P[i]=P[i-1]*i;
    Q[20000000]=P[20000000].inv();for(uint i=20000000;i;i--)Q[i-1]=Q[i]*i;
    uint n;scanf("%u",&n);
    Dp[1]=1;uint cnt2=1,cnt3=1;
    modint ans;
    for(uint k=1;cnt3<=n;k++){
        if(cnt3*3>=n){
            for(uint i=1;i<=cnt2;i++)ans+=Dp[i]*k;
            break;
        }
        uint A=n-cnt3,B=2*cnt3;
        for(uint i=1;i<=cnt2*2;i++)Last[i]=0;
        for(uint i=1;i<=cnt2;i++)
            Last[std::min(n-cnt3,i*2)]+=Dp[i],Dp[i]=0;
        cnt2*=2;
        for(uint m=1;m<=cnt2;m++){
            modint v=Last[m]*P[m]*P[A-m];
            for(uint t=std::min(m,B);~t&&A+t>=B+m;t--)
                Dp[m-t]+=v*Q[t]*Q[B-t];
        }
        for(uint m=0;m<=cnt2&&m+B<=A;m++)
            Dp[m]*=Q[A]*P[B]*P[A-B]*Q[m]*Q[A-B-m];
        ans+=Dp[0]*k,Dp[0]=0;
        cnt3*=3;
    }
    ans.println();
    return 0;
}