#include <bits/stdc++.h>
using namespace std;
#define all(a)a.begin(),a.end()
#define rall(a)a.rbegin(),a.rend()
using ll=long long;
const int INF = 1<<30;
const ll INFll =1LL<<62;
const int mod= int(1e9)+7;
const int mod2=998244353;
using P = pair<int,int>;
using Pl= pair<ll,ll>;
using ld=long double;
using V=vector<int>;
using Vl=vector<ll>;
using Vd=vector<ld>;
using VV=vector<vector<int>>;
using VVl=vector<vector<ll>>;
using VVd=vector<vector<ld>>;

// modint: mod 計算を int を扱うように扱える構造体
template<int MOD> struct Fp {
    long long val;
    constexpr Fp(long long v = 0) noexcept : val(v % MOD) {
        if (val < 0) val += MOD;
    }
    constexpr int getmod() { return MOD; }
    constexpr Fp operator - () const noexcept {
        return val ? MOD - val : 0;
    }
    constexpr Fp operator + (const Fp& r) const noexcept { return Fp(*this) += r; }
    constexpr Fp operator - (const Fp& r) const noexcept { return Fp(*this) -= r; }
    constexpr Fp operator * (const Fp& r) const noexcept { return Fp(*this) *= r; }
    constexpr Fp operator / (const Fp& r) const noexcept { return Fp(*this) /= r; }
    constexpr Fp& operator += (const Fp& r) noexcept {
        val += r.val;
        if (val >= MOD) val -= MOD;
        return *this;
    }
    constexpr Fp& operator -= (const Fp& r) noexcept {
        val -= r.val;
        if (val < 0) val += MOD;
        return *this;
    }
    constexpr Fp& operator *= (const Fp& r) noexcept {
        val = val * r.val % MOD;
        return *this;
    }
    constexpr Fp& operator /= (const Fp& r) noexcept {
        long long a = r.val, b = MOD, u = 1, v = 0;
        while (b) {
            long long t = a / b;
            a -= t * b; swap(a, b);
            u -= t * v; swap(u, v);
        }
        val = val * u % MOD;
        if (val < 0) val += MOD;
        return *this;
    }
    constexpr bool operator == (const Fp& r) const noexcept {
        return this->val == r.val;
    }
    constexpr bool operator != (const Fp& r) const noexcept {
        return this->val != r.val;
    }
    friend constexpr ostream& operator << (ostream &os, const Fp<MOD>& x) noexcept {
        return os << x.val;
    }
    friend constexpr Fp<MOD> modpow(const Fp<MOD> &a, long long n) noexcept {
        if (n == 0) return 1;
        auto t = modpow(a, n / 2);
        t = t * t;
        if (n & 1) t = t * a;
        return t;
    }
};
using mint = Fp<mod>;
using Vm=vector<mint>;

Vm even(Vm P){
    Vm R;
    int n=P.size();
    for (int i = 0; i <n;i+=2) {
        R.push_back(P[i]);
    }
    return R;
}
Vm odd(Vm P){
    Vm R;
    int n=P.size();
    for (int i =1; i < n;i+=2) {
        R.push_back(P[i]);
    }
    return R;
}
Vm mi(Vm P){
    Vm R=P;
    int n=R.size();
    for (int i = 1; i < n;i+=2) {
        R[i]*=-1;
    }
    return R;
}

Vm mul(Vm P,Vm Q){
    int n=P.size();
    int m=Q.size();
    Vm R(n+m,0);
    for (int i = 0; i < n; ++i) {
        for (int j = 0; j < m; ++j) {
            R[i+j]+=P[i]*Q[j];
        }
    }
    return R;
}

mint mori(ll n,Vm P,Vm Q){
    while(n>0){
        Vm U=mul(P,mi(Q));
        if(n%2==0)P=even(U);
        else P=odd(U);
        Q=even(mul(Q,mi(Q)));
        n/=2;
    }
    return P[0]/Q[0];
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    ll n;cin >>n;
    Vm P={0,1};
    Vm Q={1,1};
    Vm R={1,-3,1};
    Q=mul(Q,R);
    cout <<mori(n,P,Q)<<"\n";
    return 0;
}