#include <bits/stdc++.h>
using namespace std;
long long n;
long long dp[1000005][2];
void solve() {
  cin >> n;
  dp[0][0] = 0;
  dp[0][1] = 0;
  dp[1][0] = 1;
  dp[1][1] = 0;
  for (long long i = 2; i < n + 1; ++i) {
    if (i % 2) {
      dp[i][0] = (1 + dp[i - 1][1] % 1000000007 + dp[i - 1][0] % 1000000007) %
                 1000000007;
      dp[i][1] = dp[i - 1][1];
    } else {
      dp[i][1] = (1 + dp[i - 1][0] % 1000000007 + dp[i - 1][1] % 1000000007) %
                 1000000007;
      dp[i][0] = dp[i - 1][0];
    }
  }
  cout << (dp[n][0] + dp[n][1]) % 1000000007 << '\n';
}
signed main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  srand(static_cast<unsigned>(time(0)));
  long long t = 1;
  while (t--) {
    solve();
  }
  return 0;
}
