#include <iostream>
#include <algorithm>
#include <cmath>
#include <vector>
#include <complex>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <iomanip>
#include <assert.h>
#include <array>
#include <cstdio>
#include <cstring>
#include <random>
#include <functional>
#include <numeric>
#include <bitset>

using namespace std;

#define REP(i,a,b) for(int i=a;i<(int)b;i++)
#define rep(i,n) REP(i,0,n)
#define all(c) (c).begin(), (c).end()
#define zero(a) memset(a, 0, sizeof a)
#define minus(a) memset(a, -1, sizeof a)
#define minimize(a, x) a = std::min(a, x)
#define maximize(a, x) a = std::max(a, x)

typedef long long ll;

int const MOD = 1e9+7;

ll dp[1000001][3];

int main() {

  int N; cin >> N;
  dp[0][2] = 1;
  rep(i, N) {
    rep(j, 3) {
      if(j>0) dp[i+1][j-1] += dp[i][j], dp[i+1][j-1] %= MOD;
    }
    dp[i+1][2] += dp[i][0];
    dp[i+1][2] %= MOD;
    dp[i+1][2] += dp[i][1];
    dp[i+1][2] %= MOD;
  }

  cout << ((dp[N][0] + dp[N][1]) % MOD + dp[N][2]) % MOD << endl;

  return 0;
}