#include <iostream>
#include <vector>
#include <cstdio>
#include <sstream>
#include <map>
#include <string>
#include <algorithm>
#include <queue>
#include <cmath>
#include <set>
using namespace std;

#define MOD 1000000007

int main(){
	int n;
	cin >> n;
	vector<vector<long long>> dp(2, vector<long long>(2, 0));
	dp[1][0] = 1;
	for(int i=1; i<n; i++){
		vector<vector<long long>> dp_(2, vector<long long>(2, 0));
		for(int a=0; a<2; a++){
			for(int b=0; b<2; b++){
				if(a!=0 || b!=0){
					dp_[b][0] += dp[a][b];
					dp_[b][0] %= MOD;
				}
				if(b==0){
					dp_[b][1] += dp[a][b];
					dp_[b][1] %= MOD;
				}
			}
		}
		swap(dp, dp_);
	}

	long long ans = accumulate(dp[0].begin(), dp[0].end(), 0LL) + accumulate(dp[1].begin(), dp[1].end(), 0LL);
	ans %=MOD;
	cout << ans << endl;
	return 0;
}