#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
using namespace std;

int n;

int dp[2][2][1111111];
int solve(int a,int b,int k){
  if(dp[a][b][k] >= 0) return dp[a][b][k];
  if(k >= n) return 1;

  int ret = 0;
  if(a || b){
    ret += solve(b,0,k+1);
    ret %= 1000000007;
  }
  if(!b){
    ret += solve(b,1,k+1);
    ret %= 1000000007;
  }
  return dp[a][b][k] = ret;
}

int main(void){
  cin >> n;
  memset(dp,-1,sizeof(dp));
  cout << solve(1,1,0) << endl;
}