#include<iostream>
#include<vector>

using namespace std;

const int mod = 1e9 + 7;
int dp[1000001][3];
int N;

int dfs(int i, int k){
	if(dp[i][k] != 0) return dp[i][k];
	int res = 0;
	if(k < 2){
		res += dfs(i + 1, k + 1);
	}
	if(k > 0){
		res += dfs(i + 1, 0);
	}
	return dp[i][k] = res % mod;
}

int main(){
	cin >> N;
	for(int i = 0; i < 3; i++){
		dp[N][i] = 1;
	}
	int ans = dfs(0, 0);
	cout << dp[0][0] << endl;
	return 0;
}