#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC target("sse4")
using namespace std;
typedef long long ll;
const ll MAX = 1e6 + 10;
const ll inf = 1e12;
ll dp[MAX][2], mod = 1e9 + 7;
int main() {
  ll n, k;
  cin >> n;
  dp[1][1] = 1, dp[2][1] = 1;
  dp[2][0] = 2;
  ll x = 1, y = 1;
  for (ll i = 3; i < n + 1; i++) {
    if (i & 1) {
      dp[i][0] = dp[i - 1][0];
      dp[i][1] = (dp[i - 1][0] + dp[i - 1][1] + 1) % mod;
      x++;
    } else {
      dp[i][0] = (dp[i - 1][1] + dp[i - 1][0] + 1) % mod;
      dp[i][1] = dp[i - 1][1];
      y++;
    }
  }
  cout << (dp[n][1] + dp[n][0]) % mod << endl;
}
