#include<bits/stdc++.h>
using namespace std;
const int mod = 1e9 + 7;

int main(){
    int n;
    cin >> n;
    int dp[100010][3];
    for(int i = 0; i < n; i++){
        for(int j = 0; j < 3; j++){
            dp[i][j] = 0;
        }
    }
    dp[1][0] = 1;
    dp[2][1] = 1;
    dp[3][2] = 1;

    for(int i = 0; i < n; i++){
      for(int j = 0; j < 3; j++){
        for(int k = 0; k < 3; k++){
          //cerr << i << " " << j << " " << k << " " <<  dp[i][j] << endl;
          if(dp[i][j] > 0 && j != k){
            dp[i + k + 1][k] = (dp[i + k + 1][k] + dp[i][j]) % mod;
          }
        }
      }
    }

    long long ans = 0;
    for(int i = 0; i < 3; i++){
        ans = (ans + dp[n][i]) % mod;
    }
    cout << ans << endl;

}