#include <bits/stdc++.h>
using namespace std;
const long long int MOD = 1e9 + 7;
long long int qpow(long long int a, long long int n) {
  long long int res = 1;
  while (n) {
    if (n % 2) {
      res = res * a;
      res = res % MOD;
      n--;
    } else {
      n = n / 2;
      a = a * a;
      a = a % MOD;
    }
  }
  return res;
}
void soln() {
  int n;
  cin >> n;
  vector<int> arr(n + 1);
  vector<vector<long long int>> dp(n + 1, vector<long long int>(2));
  for (int i = 1; i <= n; i++) {
    if (i % 2)
      arr[i] = 1;
    else
      arr[i] = 0;
  }
  dp[1][1] = 1;
  for (int i = 2; i <= n; i++) {
    if (arr[i] == 1) {
      dp[i][1] = (dp[i - 1][0] + 1 + dp[i - 1][1]) % MOD;
      dp[i][0] = dp[i - 1][0];
    } else {
      dp[i][1] = dp[i - 1][1];
      dp[i][0] = (dp[i - 1][1] + 1 + dp[i - 1][0]) % MOD;
    }
  }
  cout << (dp[n][0] + dp[n][1]) % MOD << "\n";
}
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  soln();
}
