#include <bits/stdc++.h>
#define GET_MACRO(a, b, c, NAME, ...) NAME
#define rep(...) GET_MACRO(__VA_ARGS__, rep3, rep2)(__VA_ARGS__)
#define rep2(i, a) rep3 (i, 0, a)
#define rep3(i, a, b) for (int i = (a); i < (b); i++)
#define repr(...) GET_MACRO(__VA_ARGS__, repr3, repr2)(__VA_ARGS__)
#define repr2(i, a) repr3 (i, 0, a)
#define repr3(i, a, b) for (int i = (b) - 1; i >= (a); i--)
template<class T1, class T2> inline bool chmin(T1 &a, T2 b) { return b < a && (a = b, true); }
template<class T1, class T2> inline bool chmax(T1 &a, T2 b) { return a < b && (a = b, true); }
using namespace std;
typedef long long ll;

const ll mod = 1e9 + 7;
ll dp[1010101][3]; // k,

int main() {
	int n;
	cin >> n;
	dp[0][0] = 1;
	rep (i, n) {
		(dp[i + 1][0] += dp[i][1]) %= mod;
		(dp[i + 1][0] += dp[i][2]) %= mod;
		(dp[i + 1][1] += dp[i][0]) %= mod;
		(dp[i + 1][2] += dp[i][1]) %= mod;
	}
	ll ans = (dp[n][0] + dp[n][1] + dp[n][2]) % mod;
	cout << ans << endl;
	return 0;
}