#include <bits/stdc++.h>
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n)  for(int i=0;i<(n);i++)
#define FORq(i, m, n) for(int i = (m);i <= (n);++i)
#define SCD(n) scanf("%d",&n)
#define SCD2(m,n) scanf("%d%d",&m,&n)
#define SCD3(m,n,k) scanf("%d%d%d",&m,&n,&k)
#define PB push_back
#define MP make_pair
#define ARSCD(A,N) REP(i,N){SCD(A[i]);}
#define ARSCD1(A,N) FORq(i,1,N){SCD(A[i]);}
#define PRINTD(n) printf("%d\n",n)
#define PRINTLLD(n) printf("%lld\n",n)
#define DEBUG printf("%s\n","debug")
#define fst first
#define snd second
using namespace std;
typedef pair<int,int> PII;
typedef vector<int> VI;
typedef long long ll;
//////////////////////////////////////////////////////
int main(){
	const ll p = 1000000007;
	int N; SCD(N);
	static ll dp[1000002];
	static ll kk[1000002];
	static ll kp[1000002];
	static ll pk[1000002];
	
	dp[1] = 1;
	dp[2] = 2;
	dp[3] = 2;
	
	kk[3] = 0;
	pk[3] = 1;
	kp[3] = 1;
	
	FORq(i,4,N){
		dp[i] = (dp[i-1] + pk[i-1]) % p;
		
		kp[i] = (kk[i-1] + pk[i-1]) % p;
		pk[i] = kp[i-1] % p;
		kk[i] = pk[i-1] % p;
		
	}
	
	PRINTLLD(dp[N]);
	
	return 0;
}