#include <stdio.h>
#include <string.h>

using namespace std;

int N;
long long solve(int i, int j);
long long dp[1000010][3];
int main(void){
	scanf("%d", &N);

	memset(dp, -1, sizeof(dp));

	printf("%lld\n", solve(0, 0) % (1000000007));
}

long long solve(int i, int j){
	if(i == N) return 1;

	if(dp[i][j] != -1) return dp[i][j];

	if(j == 0){
		return dp[i][j] = solve(i+1, 1);
	}else if(j == 1){
		return dp[i][j] = (solve(i+1, 0) + solve(i+1, 2));
	}else if(j == 2){
		return dp[i][j] = solve(i+1, 0);
	}
}