#include <bits/stdc++.h>
using namespace std;
long long dp[1000001][2];
long long arr[1000001];
long long n;
long long modF(long long n) {
  return (n % 1000000007 + 1000000007) % 1000000007;
}
long long solve(long long index, long long prev) {
  if (index > n) {
    return 1LL;
  }
  if (dp[index][prev] == INT_MAX) {
    if (arr[index] == prev) {
      dp[index][prev] = solve(index + 1, prev);
    } else {
      dp[index][prev] = solve(index + 1, arr[index]) + solve(index + 1, prev);
    }
    dp[index][prev] = modF(dp[index][prev]);
  }
  return dp[index][prev];
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cin >> n;
  for (long long i = 1; i <= n; i++) {
    arr[i] = (i % 2LL);
    dp[i][0] = dp[i][1] = INT_MAX;
  }
  long long ans = 0;
  for (long long i = 1; i <= n; i++) {
    ans = modF(ans + solve(i + 1, arr[i]));
  }
  cout << ans << endl;
}
