#include <bits/stdc++.h>

using namespace std;
typedef long long ll;
typedef long int li;
typedef long double lb;
#define rep(i,j,n) for (ll i = j; i < (n); i++)
#define repr(i,j,n) for(ll i = j; i >= (n); i--)
#define all(x) (x).begin(),(x).end()
#define CLR(mat,f) memset(mat, f, sizeof(mat))
#define IN(a, b, x) (a<=x&&x<b)
#define out(ans) cout << ans << endl
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
typedef pair<ll,ll>P;
const ll mod=1e9+7;
const int INF = 1000000;
const double PI=3.14159265359;

int main(){

  ll n;cin>>n;
  ll dp[n][3];
  rep(i,0,n)CLR(dp[i],0);
  dp[0][0]=1;
  dp[0][1]=0;
  dp[0][2]=0;
  rep(i,1,n){
    dp[i][0]+=dp[i-1][2]%mod;
    dp[i][0]%=mod;

    dp[i][1]+=dp[i-1][0]%mod;
    dp[i][1]%=mod;

    dp[i][2]+=(dp[i-1][0]+dp[i-1][1])%mod;
    dp[i][2]%=mod;
  }

  out(((dp[n-1][0]+dp[n-1][1])%mod+dp[n-1][2])%mod);

  return 0;
}