#include<iostream>
#include<algorithm>
#include<string.h>

using namespace std;

const int lim = 1e6 + 1;
int dp[lim][3];
int main(){
	memset(dp,0,sizeof(dp));
	int n;
	cin >> n;
	dp[0][1] = 1;
	int div = 1e9 + 7;
	for(int i = 0;i < n-1;i++){
		for(int j = 0;j < 3;j++){
			if(dp[i][j] > 0){
				if(j == 0){
					dp[i+1][j+1] = (dp[i+1][j+1] + dp[i][j]) % div;
				}else if(j == 2){
					dp[i+1][0] = (dp[i+1][0] + dp[i][j]) % div;
				}else{
					dp[i+1][0] = (dp[i+1][0] + dp[i][j]) % div;
					dp[i+1][j+1] = (dp[i+1][j+1] + dp[i][j]) % div;
				}
			}
		}
	}
	
	int ans = 0;
	for(int i = 0;i < 3;i++){
		ans = (ans + dp[n-1][i]) % div;
	}
	
	cout << ans << endl;
}