/****************
 *@description:for the Escape Project
 *@author: Nebula_xuan
 * @Date: 2022-12-03 20:37:06
 *************************************************************************/

#include <iostream>
#include <algorithm>
#include <cstring>
#include <cstdio>
#include <set>
#include <vector>
#include <queue>
#include <map>
#include <unordered_map>
#include <cmath>
#include <iomanip>
#include <assert.h>
// cout << fixed << setprecision(8) <<a;

using namespace std;

#define endl char(10)
#define int long long
#define hey cout << 1 << endl
//记得%d应该写成%lld

typedef pair<int, int> PII;
typedef long long ll;
const int N = 14e6 + 10;
int n, p[N], dp[16][N];
int ny[N];
const int MOD = 1e9 + 7;
int qmi(int a, int b)
{
    int ans = 1;
    while (b)
    {
        if (b & 1)
            ans = ans * a % MOD;
        a = a * a % MOD;
        b >>= 1;
    }
    return ans;
}
int inv(int x)
{
    return qmi(x, MOD - 2);
}
int c(int n, int m)
{
    if (m > n)
        return 0;
    return (p[n] * ny[m] % MOD) * ny[n - m] % MOD;
}
void solve()
{
    cin >> n;
    dp[0][1] = 1;
    p[0] = 1;
    for (int i = 1; i <= n + 5; i++)
        p[i] = p[i - 1] * i % MOD;
    ny[n + 5] = qmi(p[n + 5], MOD - 2);
    for (int i = n + 4; i >= 0; i--)
        ny[i] = (ny[i + 1] * (i + 1)) % MOD;
    for (int i = 1; i <= 15; i++)
    {
        int sheng = n - qmi(3, i - 1), xuan = qmi(3, i) - qmi(3, i - 1);
        if (sheng <= xuan)
        {
            for (int j = 1; j <= (1 << (i - 1)); j++)
                dp[i][0] = (dp[i][0] + dp[i - 1][j]) % MOD;
            break;
        }
        int all = inv(c(sheng, xuan));
        for (int j = 0; j <= (1 << i); j++)
        {
            for (int k = max(1ll, (j + 1) >> 1); k <= (1 << (i - 1)); k++)
            {
                int gan = 2 * k - j;
                dp[i][j] = (dp[i][j] + dp[i - 1][k] * c(2 * k, gan) % MOD * c(sheng - 2 * k, xuan - gan) % MOD * all) % MOD;
            }
        }
    }
    int ans = 0;
    for (int i = 1; i <= 15; i++)
        ans = (ans + dp[i][0] * i) % MOD;
    cout << ans;
}

signed main()
{
    int T;
    T = 1;

    while (T--)
    {
        solve();
    }
}