#include<bits/stdc++.h>
#include<atcoder/all>
#define rep(i,b) for(int i=0;i<b;i++)
#define rrep(i,b) for(int i=b-1;i>=0;i--)
#define rep1(i,b) for(int i=1;i<b;i++)
#define repx(i,x,b) for(int i=x;i<b;i++)
#define fore(i,a) for(auto i:a)
#define fore1(i,a) for(auto &i:a)
#define rng(x) (x).begin(), (x).end()
#define rrng(x) (x).rbegin(), (x).rend()
#define sz(x) ((int)(x).size())
#define pb push_back
#define fi first
#define se second

using namespace std;
using namespace atcoder;

using ll = long long;
template<typename T> using mpq = priority_queue<T, vector<T>, greater<T>>;
template<typename T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<typename T> bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
template<typename T> ll sumv(const vector<T>&a){ll res(0);for(auto&&x:a)res+=x;return res;}
bool yn(bool a) { if(a) {cout << "Yes" << endl; return 1;} else {cout << "No" << endl; return 0;}}
#define dame { cout << "No" << endl; return 0;}
#define dame1 { cout << -1 << endl; return 0;}
#define test(x) cout << "test" << x << endl;
#define deb(x,y) cout << x << " " << y << endl;
#define deb3(x,y,z) cout << x << " " << y << " " << z << endl;
#define deb4(x,y,z,x2) cout << x << " " << y << " " << z << " " << x2 << endl;
#define out cout << ans << endl;
#define outv fore(yans , ans) cout << yans << "\n";
#define show(x) cerr<<#x<<" = "<<x<<endl;
#define showv(v) {fore(vy , v) {cout << vy << " ";} cout << endl;}
#define showv2(v) fore(vy , v) cout << vy << "\n";
using pll = pair<ll,ll>;
using pil = pair<int,ll>;
using pli = pair<ll,int>;
using pii = pair<int,int>;
using tp = tuple<int ,int ,int>;
using vi = vector<int>;
using vl = vector<ll>;
using vs = vector<string>;
using vb = vector<bool>;
using vpii = vector<pii>;
using vpli = vector<pli>;
using vpll = vector<pll>;
using vpil = vector<pil>;
using vvi = vector<vector<int>>;
using vvl = vector<vector<ll>>;
using vvs = vector<vector<string>>;
using vvb = vector<vector<bool>>;
using vvpii = vector<vector<pii>>;
using vvpli = vector<vector<pli>>;
using vvpll = vector<vpll>;
using vvpil = vector<vpil>;
using mint = modint1000000007;
using vm = vector<mint>;
using vvm = vector<vector<mint>>;
vector<int> dx={1,0,-1,0,1,1,-1,-1},dy={0,1,0,-1,1,-1,1,-1};
ll gcd(ll a, ll b) { return a?gcd(b%a,a):b;}
ll lcm(ll a, ll b) { return a/gcd(a,b)*b;}
const double eps = 1e-10;
const ll LINF = 1001002003004005006ll;
const int INF = 1001001001;

vvm f (vvm a, vvm b){
    vvm ret(4,vm(4));

    rep(i,4) rep(j,4) rep(k,4) ret[i][j] += a[i][k] * b[k][j];

    return ret;
}

int main(){
    ll n; cin>>n;

    vm v(5);
    // vm v(n+1);

    v[1] = 1;
    v[2] = 1;
    v[3] = 3;
    v[4] = 2;

    repx(i,5,n+1){
        v[i] = v[i-2] + v[i-4];
        if (i%2 == 1) v[i] += v[i-1];
    }

    // rep(i,n+1){
    //     show(i);
    //     cout << v[i].val() << endl;
    // }

    if (n <= 4){
        cout << v[n].val() << endl;
        return 0;
    }

    vvm a(4,vm(4));
    vvm b(4,vm(4));
    vvm c(4,vm(4));

    a[0][0] = 1;
    a[0][1] = 1;
    a[0][3] = 1;
    a[1][0] = 1;
    a[2][1] = 1;
    a[3][2] = 1;

    b[0][1] = 1;
    b[0][3] = 1;
    b[1][0] = 1;
    b[2][1] = 1;
    b[3][2] = 1;

    c = f(b,a);

    // rep(i,4){
    //     rep(j,4) cout << c[i][j].val() << " ";
    //     cout << endl;
    // }

    const int logmax = 64;

    vector<vvm> db(logmax , vvm(4 , vm(4)));

    db[0] = c;

    rep1(i,logmax) db[i] = f(db[i-1] , db[i-1]);
    

    ll m = (n-4) / 2;
    

    vvm now(4,vm(4));

    rep(i,4) now[i][i] = 1;

    rep(i,logmax) if ((m >> i & 1) == 1) now = f(now , db[i]);

    if ((n-4)%2 == 1) now = f(a , now);

    // rep(i,4){
    //     rep(j,4) cout << now[i][j].val() << " ";
    //     cout << endl;
    // }

    mint ans = 0;

    rep(i,4) ans += v[4-i] * now[0][i];

    cout << ans.val() << endl;
    



    return 0;
}