#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
using mint = modint1000000007;
const int mod = 1000000007;
//using mint = modint998244353;
//const int mod = 998244353;
//const int INF = 1e9;
//const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n-1); i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r-1);i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define endl "\n"
#define P pair<int,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }

int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int n; cin >> n;
	if (n < 4) {
		cout << 0 << endl;
		return 0;
	}
	vector<vector<mint>> dp(n - 2, vector<mint>(8));
	rep(i, 8)dp[0][i] = 1;
	rep(i, dp.size() - 1) {
		rep(j, 8) {
			int nj = (j % 4) * 2;
			dp[i + 1][j] = dp[i][nj] + dp[i][nj + 1];
		}
		dp[i + 1][5] -= dp[i][2];
	}
	mint ans = pow_mod(2, n, mod);
	rep(i, 8)ans -= dp[n - 3][i];
	cout << ans.val() << endl;
	return 0;
}