#include <bits/stdc++.h>

using namespace std;

//typedef
//------------------------------------------
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef long long LL;

//container util
//------------------------------------------
#define ALL(a)  (a).begin(),(a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define PB push_back
#define MP make_pair
#define SZ(a) int((a).size())
#define EACH(i,c) for(typeof((c).begin()) i=(c).begin(); i!=(c).end(); ++i)
#define EXIST(s,e) ((s).find(e)!=(s).end())
#define SORT(c) sort((c).begin(),(c).end())

//repetition
//------------------------------------------
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n)  FOR(i,0,n)

//constant
//--------------------------------------------
const double EPS = 1e-10;
const double PI  = acos(-1.0);
const LL MOD = 1e9+7;

int main(){
  cin.tie(0);
  ios_base::sync_with_stdio(false);

  int N; cin >> N;
  vector<vector<LL>> dp(2, vector<LL>(3));
  int crt = 0, nxt = 1;
  dp[crt][0] = 1;
  for(int i=1;i<=N;++i){
	dp[nxt][0] = (dp[crt][1] + dp[crt][2]) % MOD;
	dp[nxt][1] = dp[crt][0];
	dp[nxt][2] = dp[crt][1];
	swap(crt, nxt);
  }

  cout << (accumulate(ALL(dp[crt]),0LL) % MOD) << endl;
  
  return 0;
}