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

typedef long long ll;
ll const mod = 1e9+7;

#define p_ary(ary,a,b,i) do { cout << "["; for (int (i) = (a);(i) < (b);++(i)) cout << ary[(i)] << ((b)-1 == (i) ? "" : ", "); cout << "]\n"; } while(0)
#define p_map(map,it) do {cout << "{";for (auto (it) = map.begin();;++(it)) {if ((it) == map.end()) {cout << "}\n";break;}else cout << "" << (it)->first << "=>" << (it)->second << ", ";}}while(0)

vector<vector<ll>> prod(vector<vector<ll>>& a, vector<vector<ll>>& b, ll mod) {
    vector<vector<ll>> ret(a.size(),vector<ll>(b[0].size(),0));
    for (int i = 0;i < a.size();++i) for (int j = 0;j < b[0].size();++j) for (int k = 0;k < a[0].size();++k) {
        ret[i][j] += a[i][k]*b[k][j];
        ret[i][j] %= mod;
    }
    return ret;
}

int main() {
    ll n;
    cin >> n;
    vector<vector<ll>> e(1,vector<ll>(2,1)),c(2,vector<ll>(2,0));
    c[0][0] = 10;
    c[1][0] = 3;
    c[1][1] = 1;
    e[0][0] = 13;
    n--;
    while (n) {
        if (n&1) e = prod(e,c,mod);
        c = prod(c,c,mod);
        n >>= 1;
    }
    cout << e[0][0] << endl;
    return 0;
}