#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef complex<double> P;
typedef pair<int,int> pii;
#define REP(i,n) for(ll i=0;i<n;++i)
#define REPR(i,n) for(ll i=1;i<n;++i)
#define FOR(i,a,b) for(ll i=a;i<b;++i)

#define DEBUG(x) cout<<#x<<": "<<x<<endl
#define DEBUG_VEC(v) cout<<#v<<":";REP(i,v.size())cout<<" "<<v[i];cout<<endl
#define ALL(a) (a).begin(),(a).end()

#define MOD (ll)(1e9+7)
#define ADD(a,b) a=((a)+(b))%MOD
#define FIX(a) ((a)%MOD+MOD)%MOD

ll solve(ll n){
  if(n==1)return 1;
  if(n==2)return 2;
  if(n==3)return 2;
  ll dp[4] = {0,0,1,1};
  FOR(i,4,n+1)dp[i%4]=(dp[(i-2)%4]+dp[(i-3)%4])%MOD;
  ll ans = dp[n%4]+dp[(n-1)%4]+dp[(n-2)%4];
  return ans%MOD;
}

int main(){
  ll n;
  cin >> n;
  cout << solve(n) << endl;
  return 0;
}