#include<bits/stdc++.h>
using namespace std;
#define ctz __builtin_ctzll
#define ppc __builtin_popcountll
#define par __builtin_parityll
#define all(x) (x).begin(), (x).end()
using LL = long long;
using ull = unsigned long long;
using db = double;
using ldb = long double;
const int INF = 1e9;
const db EPS = 1e-8;
const db PI = acos(-1);

const int mod = 1e9 + 7;

int norm(int x) {
    if (x < 0) {x += mod;}
    if (x >= mod) {x -= mod;}
    return x;
}
template<class T>
T ksm(T x,LL y){
    T res = 1;
    for(;y;y>>=1){
        if(y&1)
            res = res*x;
        x=x*x;
    }
    return res;
}
struct modint {
    int x;
    modint(int x = 0) : x(norm(x)) {}
    modint(LL x) : x(norm((int)(x%mod))) {}
    int val() const {return x;}
    modint operator-() const {return modint(norm(mod - x));}
    modint inv() const {assert(x != 0);return ksm(*this, mod - 2);}
    modint &operator*=(const modint &rhs) {x = LL(x) * rhs.x % mod;return *this;}
    modint &operator+=(const modint &rhs) {x = norm(x + rhs.x);return *this;}
    modint &operator-=(const modint &rhs) {x = norm(x - rhs.x);return *this;}
    modint &operator/=(const modint &rhs) {return *this *= rhs.inv();}
    friend modint operator*(const modint &lhs, const modint &rhs) {modint res = lhs;res *= rhs;return res;}
    friend modint operator+(const modint &lhs, const modint &rhs) {modint res = lhs;res += rhs;return res;}
    friend modint operator-(const modint &lhs, const modint &rhs) {modint res = lhs;res -= rhs;return res;}
    friend modint operator/(const modint &lhs, const modint &rhs) {modint res = lhs;res /= rhs;return res;}
    friend std::istream &operator>>(std::istream &is, modint &a) {LL v;is >> v;a = modint(v);return is;}
    friend std::ostream &operator<<(std::ostream &os, const modint &a) {return os << a.val();}
};

int main() {
    ios::sync_with_stdio(0), cin.tie(0);
    cout << fixed << setprecision(15);

    int n;
    cin >> n;

    vector<modint> fac(n + 1), ifac(n + 1);
    fac[0] = 1;
    for(int i = 1; i <= n; i ++) {
        fac[i] = fac[i - 1] * i;
    }
    ifac[n] = fac[n].inv();
    for(int i = n; i >= 1; i --) {
        ifac[i - 1] = ifac[i] * i;
    }

    auto C = [&](int x, int y) -> modint {
        if(x < y) {
            return modint(0);
        }
        return fac[x] * ifac[y] * ifac[x - y];
    };

    vector<vector<modint>> f(16, vector<modint>(16385, 0));
    f[0][1] = 1;
    for(int i = 1; i <= 15; i ++) {
        int s = n - ksm(3, i - 1), t = 2 * ksm(3, i - 1);
        if(s <= t) {
            for(int j = 1; j <= (1 << (i - 1)); j ++) {
                f[i][0] += f[i - 1][j];
            }
            break;
        }
        assert(s > t);
        modint inv = C(s, t).inv();
        for(int j = 0; j <= (1 << i); j ++) {
            for(int k = max(1, (j + 1) >> 1); k <= (1 << (i - 1)); k ++) {
                int g = 2 * k - j;
                f[i][j] += f[i - 1][k] * C(2 * k, g) * C(s - 2 * k, t - g) * inv;
            }
        }
    }

    modint ans = 0;
    for(int i = 1; i <= 15; i ++) {
        ans += i * f[i][0];
    }

    cout << ans << '\n';

    return 0;
}