#include <bits/stdc++.h>
using namespace std;
const long long modi = 1000000007;
int main() {
  long long n, i;
  cin >> n;
  long long dp[n][2], pre[n][2];
  for (i = 0; i < n; i++) {
    dp[i][0] = 0;
    dp[i][1] = 0;
    pre[i][0] = 0;
    pre[i][1] = 0;
  }
  dp[0][0] = 1;
  pre[0][0] = dp[0][0];
  dp[1][1] = 2;
  pre[1][1] = dp[1][1];
  for (i = 2; i < n; i++) {
    if (i % 2 == 0) {
      dp[i][0] = (dp[i][0] + pre[i - 1][1] + 1) % modi;
      pre[i][0] = (pre[i - 2][0] + dp[i][0]) % modi;
    } else {
      dp[i][1] = (dp[i][1] + pre[i - 1][0] + 1) % modi;
      pre[i][1] = (pre[i - 2][1] + dp[i][1]) % modi;
    }
  }
  if (n == 1) {
    cout << 1;
    return 0;
  }
  if (n == 2) {
    cout << 3;
    return 0;
  }
  if ((n - 1) & 1) {
    cout << (pre[n - 1][1] + pre[n - 2][0]) % modi;
  } else {
    cout << (pre[n - 1][0] + pre[n - 2][1]) % modi;
  }
  return 0;
}
