#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <functional>
#include <iostream>
#include <iterator>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <valarray>
#include <vector>

#define N 1000
#define MOD 1000000007
#define pe(str) return cout<<(str)<<endl,0
#define px(str) {cout<<(str)<<endl;exit(0);}
#define re(i,n) for(int i=0;i<(n);i++)
#define rep(i,a,b) for(int i=(a);i<(b);i++)
#define fe(i,n,f) for_each(i,n,f)
#define bw(a,b,c) (((a)<=(b))&&((b)<=(c)))
using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<int,int> pii;

int main(void){
	int n;
	cin>>n;
	ll k[n+1];
	ll kk[n+1];
	ll p[n+1];
	k[0]=0;
	kk[0]=0;
	p[0]=1;
	rep(i,1,n+1){
		k[i]=p[i-1];
		kk[i]=k[i-1];
		p[i]=kk[i-1]+k[i-1];
		k[i]%=MOD;
		kk[i]%=MOD;
		p[i]%=MOD;
	}
	cout<<((k[n]+kk[n])%MOD+p[n])%MOD<<endl;
	return 0;
}