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

// 0    1    2    3    4    5    6    7    8    9    10   11
// v--- -v-- --v- ---v v^V- v^-V v_^V -v^V V^v- V^-v V_^v -V^v

vector<vector<long long>> mat = {{1,1,1,1,1,1,1,1,0,0,0,0},
                                 {1,1,1,1,0,0,1,1,0,0,0,0},
                                 {1,1,1,1,0,0,0,0,1,1,0,0},
                                 {1,1,1,1,0,0,0,0,1,1,1,1},
                                 {0,0,1,1,1,1,0,0,0,0,0,0},
                                 {0,0,1,1,1,1,1,0,0,0,0,0},
                                 {0,0,0,1,0,1,1,1,0,0,0,0},
                                 {0,0,0,1,0,0,1,1,0,0,0,0},
                                 {1,0,0,0,0,0,0,0,1,1,0,0},
                                 {1,0,0,0,0,0,0,0,1,1,1,0},
                                 {1,1,0,0,0,0,0,0,0,1,1,1},
                                 {1,1,0,0,0,0,0,0,0,0,1,1}};

constexpr long long mod = 1e9+7;

vector<vector<long long>> matmul(vector<vector<long long>> a, vector<vector<long long>> b){
    vector<vector<long long>> c(12, vector<long long>(12, 0));
    for (int i = 0; i != 12; ++i){
        for (int j = 0; j != 12; ++j){
            for (int k = 0; k != 12; ++k){
                c[i][j] = (c[i][j] + a[i][k] * b[k][j]) % mod;
            }
        }
    }
    return c;
}

long long solve(long long N){
    vector<vector<long long>> m(12, vector<long long>(12, 0LL));
    for (int i = 0; i != 12; ++i) m[i][i] = 1LL;
    vector<vector<long long>> c = mat;
    ++N;
    while (N){
        if (N & 1) m = matmul(m, c);
        c = matmul(c, c);
        N >>= 1;
    }
    return m[0][3];
}

int main(){
    cin.tie(0);
    ios::sync_with_stdio(false);
    long long N;
    cin >> N;
    cout << solve(N) << endl;
    return 0;
}