#include <iostream>
#include <algorithm>
#include <vector>
#include <iomanip>
using namespace std;

typedef long long ll;
typedef pair<int, int> P;
const int INF = (int)1e9 + 1;
const int mod = 1e9 + 7;

ll dp[1000010][3];

int main(void) {
	int n;
	cin >> n;

	for (int i = 0; i < 3; i++) {
		dp[0][i] = 0;
	}

	dp[1][0] = 0;
	dp[1][1] = 1;
	dp[1][2] = 0;

	for (int i = 2; i <= n; i++) {
		dp[i][0] = (dp[i - 1][1] + dp[i - 1][2]) % mod;
		dp[i][1] = dp[i - 1][0] % mod;
		dp[i][2] = dp[i - 1][1] % mod;
	}

	cout << (dp[n][0] + dp[n][1] + dp[n][2]) % mod << endl;
	return 0;
}