#include <math.h>
#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
#define rep(i, l, n) for (int i = (l); i < (n); i++)
#define ite(i, a) for(auto& i : a)
#define all(x) x.begin(), x.end()
#define lb lower_bound
#define ub upper_bound
#define lbi(A, x) (ll)(lb(all(A), x) - A.begin())
#define ubi(A, x) (ll)(ub(all(A), x) - A.begin())
using ll = long long;
using Pair = pair<int, int>;
template <class T>	using V = vector<T>;
template <class T>	using VV = V<V<T> >;
const ll INF = 1000000000000000001;
const int inf = 1001001001;
const ll mod = 1000000007;
const ll MOD = 998244353;
template <class T>  inline V<T> getList(int n) { V<T> res(n); rep(i, 0, n) { cin >> res[i]; }return res; }
template <class T>  inline VV<T> getGrid(int m, int n) { VV<T> res(m, V<T>(n)); rep(i, 0, m) { res[i] = getList<T>(n); }return res; }
inline V<int> dtois(string& s) { V<int> vec = {}; for (auto& e : s) { vec.push_back(e - '0'); } return vec; }

ll powmod(ll a, ll n) {
	ll res = 1;
	while (n) {
		if (n & 1) {
			res *= a;
			res %= mod;
		}
		n >>= 1;
		a *= a;	a %= mod;
	}
	return res;
}

int main(void) {
	ll n;	cin >> n;
	if (n <= 3) {
		cout << 0 << endl;
		return 0;
	}

	V<ll> dp(16, 1);	dp[10] = 0;
	rep(i, 4, n) {
		V<ll> ndp(16);
		rep(j, 0, 16) {
			int t = j >> 1;
			ndp[j] = (dp[t] + dp[t + 8]) % mod;
		}
		ndp[10] = 0;
		dp = ndp;
	}

	ll ans = powmod(2, n);
	ite(i, dp) {
		ans += mod - i;
		ans %= mod;
	}

	cout << ans << endl;
	return 0;
}