#include <bits/stdc++.h>
using namespace std;
const int MAXN = 1111111;
const int MOD = 1000000007;
int dp[MAXN][3];
int main() {
  int n;
  int sum0 = 0, sum1 = 0;
  dp[0][2] = 1;
  for (int i = (int)1; i < (int)MAXN; i++) {
    if (i & 1) {
      dp[i][1] = (dp[i - 1][0] + dp[i - 1][1] + 1) % MOD;
      dp[i][0] = dp[i - 1][0];
    } else {
      dp[i][0] = (dp[i - 1][1] + dp[i - 1][0] + 1) % MOD;
      dp[i][1] = dp[i - 1][1];
    }
  }
  scanf("%d", &n);
  cout << (dp[n][0] + dp[n][1]) % MOD << endl;
}
