#include <bits/stdc++.h>
using namespace std;

using i64 = long long;

template <int P>
struct Modint {
    int v;

    constexpr Modint() : v(0) {}
    constexpr Modint(i64 v_) : v(v_ % P) {
        if (v < 0) {
            v += P;
        }
    }
    constexpr explicit operator int() const { return v; }
    constexpr friend ostream& operator<<(ostream &out, Modint n) {
        return out << int(n);
    }
    constexpr friend istream& operator>>(istream &in, Modint &n) {
        i64 v;
        in >> v;
        n = Modint(v);
        return in;
    }

    constexpr friend bool operator==(Modint a, Modint b) {
        return a.v == b.v;
    }
    constexpr friend bool operator!=(Modint a, Modint b) {
        return a.v != b.v;
    }

    constexpr Modint operator-() {
        Modint res;
        res.v = v ? P - v : 0;
        return res;
    }

    constexpr Modint& operator++() {
        v++;
        if (v == P) v = 0;
        return *this;
    }
    constexpr Modint& operator--() {
        if (v == 0) v = P;
        v--;
        return *this;
    }
    constexpr Modint& operator+=(Modint o) {
        v -= P - o.v;
        v = (v < 0) ? v + P : v;
        return *this;
    }
    constexpr Modint& operator-=(Modint o) {
        v -= o.v;
        v = (v < 0) ? v + P : v;
        return *this;
    }
    constexpr Modint& operator*=(Modint o) {
        v = 1LL * v * o.v % P;
        return *this;
    }
    constexpr Modint& operator/=(Modint o) { return *this *= o.inv(); }

    constexpr friend Modint operator++(Modint &a, int) {
        Modint r = a;
        ++a;
        return r;
    }
    constexpr friend Modint operator--(Modint &a, int) {
        Modint r = a;
        --a;
        return r;
    }

    constexpr friend Modint operator+(Modint a, Modint b) {
        return Modint(a) += b;
    }
    constexpr friend Modint operator-(Modint a, Modint b) {
        return Modint(a) -= b;
    }
    constexpr friend Modint operator*(Modint a, Modint b) {
        return Modint(a) *= b;
    }
    constexpr friend Modint operator/(Modint a, Modint b) {
        return Modint(a) /= b;
    }

    constexpr Modint qpow(i64 p) {
        Modint res = 1, x = v;
        while (p > 0) {
            if (p & 1) { res *= x; }
            x *= x;
            p >>= 1;
        }
        return res;
    }
    constexpr Modint inv() {
        return qpow(P - 2);
    }
};

constexpr int P = 1e9 + 7;
using Mint = Modint<P>;

vector<Mint> operator*(vector<Mint> a, vector<Mint> b) {
    if (a.empty() || b.empty()) { return {}; }
    int n = a.size(), m = b.size();
    vector<Mint> c(n + m - 1);
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < m; j++) {
            c[i + j] += a[i] * b[j];
        }
    }
    return c;
}

// p : a[0] ~ a[d - 1]
// q : \sum a[i - j]q[j] = 0
template <typename T>
T linearRecurrence(vector<T> p, vector<T> q, i64 n) {
    int d = q.size() - 1;
    assert(int(p.size()) == d);
    p = p * q;
    p.resize(d);
    while (n > 0) {
        auto nq = q;
        for (int i = 1; i <= d; i += 2) {
            nq[i] *= -1;
        }
        auto np = p * nq;
        nq = q * nq;
        for (int i = 0; i < d; i++) {
            p[i] = np[i * 2 + n % 2];
        }
        for (int i = 0; i <= d; i++) {
            q[i] = nq[i * 2];
        }
        n /= 2;
    }
    return p[0] / q[0];
}

int main() {
    cin.tie(nullptr)->sync_with_stdio(false);

    int n;

    auto solve = [&]() {
        if (n == 1) {
            cout << "1\n";
            return;
        }

        Mint ans = linearRecurrence<Mint>({2, 6, 16, 36}, {1, -3, 2, -1, 1}, n - 2);
        cout << ans << '\n';
    };
    
    while (cin >> n) {
        solve();
    }
    
    return 0;
}