#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <cmath>
using namespace std;
using ll = long long;

struct ModInt {
    ModInt() : i(0) {}
    ModInt(ll k) : i(k % Mod) {}
    ModInt operator+(ModInt m) const {
        ModInt r;
        r.i = i + m.i;
        if (r.i >= Mod) r.i -= Mod;
        return r;
    }
    ModInt operator-(ModInt m) const {
        ModInt r;
        r.i = i - m.i;
        if (r.i < 0) r.i += Mod;
        return r;
    }
    ModInt operator*(ModInt m) const {
        ModInt r;
        r.i = (ll)i * m.i % Mod;
        return r;
    }
    ModInt &operator+=(ModInt m) {
        i += m.i;
        if (i >= Mod) i -= Mod;
        return *this;
    }
    ModInt &operator-=(ModInt m) {
        i -= m.i;
        if (i < 0) i += Mod;
        return *this;
    }
    ModInt &operator*=(ModInt m) {
        i = (ll)i * m.i % Mod;
        return *this;
    }
    ModInt operator-() const {
        ModInt r;
        r.i = i == 0 ? 0 : Mod - i;
        return r;
    }
    ModInt pow(ll k) const {
        ModInt r = 1, t = *this;
        for (; k != 0; k /= 2) {
            if (k & 1) r *= t;
            t *= t;
        }
        return r;
    }
    //Modが素数のときのみ
    ModInt inv() const {
        return pow(Mod - 2);
    }
    ModInt operator/(ModInt m) const {
        return *this * m.inv();
    }
    ModInt &operator/=(ModInt m) {
        return *this *= m.inv();
    }
    constexpr static inline int Mod = 1000000007;
    int i;
};

template <class T, int N>
struct ColumnVector {
    struct SquareMatrix {
        static SquareMatrix E() {
            SquareMatrix r;
            for (int i = 0; i < N; i++) {
                for (int j = 0; j < N; j++) {
                    r.a[i][j] = i == j;
                }
            }
            return r;
        }
        ColumnVector operator*(const ColumnVector &v) const {
            ColumnVector r;
            for (int i = 0; i < N; i++) {
                T t = 0;
                for (int k = 0; k < N; k++) {
                    t += a[i][k] * v.a[k];
                }
                r.a[i] = t;
            }
            return r;
        }
        SquareMatrix operator*(const SquareMatrix &x) const {
            SquareMatrix r;
            for (int i = 0; i < N; i++) {
                for (int j = 0; j < N; j++) {
                    T t = 0;
                    for (int k = 0; k < N; k++) {
                        t += a[i][k] * x.a[k][j];
                    }
                    r.a[i][j] = t;
                }
            }
            return r;
        }
        SquareMatrix pow(ll k) const {
            SquareMatrix r = E(), t = *this;
            for (; k != 0; k /= 2) {
                if (k & 1) r = r * t;
                t = t * t;
            }
            return r;
        }
        void print() const {
            for (int i = 0; i < N; i++) {
                for (int j = 0; j < N; j++) {
                    cout << a[i][j].i << " \n"[j == N - 1];
                }
            }
        }
        T a[N][N];
    };
    void print() const {
        for (int i = 0; i < N; i++) {
            cout << a[i].i << " \n"[i == N - 1];
        }
    }
    T a[N];
};

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);

    ll n;
    cin >> n;

    ColumnVector<ModInt, 6> v;
    for (int i = 0; i < 6; i++) {
        v.a[i] = i == 5;
    }

    decltype(v)::SquareMatrix x;
    for (int i = 0; i < 5; i++) {
        x.a[i][i + 1] = 1;
    }
    for (int j = 0; j < 6; j++) {
        x.a[5][j] = (ModInt)1 / 6;//(6 - j)
    }

    v = x.pow(n) * v;

    cout << v.a[5].i << endl;

    return 0;
}