#include<iostream>
#include<algorithm>
#include<string>
#include<vector>
#include<queue>
#include<cmath>
#include<functional>
using namespace std;
int dp[1000009][4], mod = 1000000007, n;
int main() {
	dp[0][0] = 1; cin >> n;
	for (int i = 0; i < n; i++) {
		for (int j = 0; j < 4; j++) {
			for (int k = 1; k <= 3; k++) {
				if (j != k) { dp[i + k][k] += dp[i][j]; dp[i + k][k] %= mod; }
			}
		}
	}
	cout << (1LL * dp[n][0] + 1LL * dp[n][1] + 1LL * dp[n][2] + 1LL * dp[n][3]) % mod << endl;
	return 0;
}