#include<cstdio>
#include <iostream>
#include<algorithm>
#include<string>
#include<queue>
#include<vector>
#include<functional>
#include<cmath>
#include<map>
#include<stack>
#include<set>
#include<numeric>

#define mod 1000000007;

using namespace std;
typedef long long ll;
typedef pair<ll, ll> Pr;

ll dp[1000010][4];

int main()
{
	int N;
	cin >> N;

	dp[0][0] = 1;
	for (int i = 0; i < N; i++) {
		for (int j = 0; j < 4; j++) {
			for(int k=1; k<4; k++){
				if (k != j) {
					dp[i + k][k] += dp[i][j];
					dp[i + k][k] %= mod;
				}
			}
		}
	}

	ll ans = 0;
	for (int i = 0; i < 4; i++) {
		ans += dp[N][i];
		ans %= mod;
	}
	cout << ans << endl;
	return 0;
}