#include <bits/stdc++.h>
using namespace std;
const int MaxN = 1100000;
int f[MaxN][2], n;
int main() {
  cin >> n;
  for (int i = 1; i <= n; ++i) {
    f[i][0] = f[i - 1][0];
    f[i][1] = f[i - 1][1];
    i & 1 ? f[i][0] = (f[i][0] + f[i - 1][1] + 1) % 1000000007
          : f[i][1] = (f[i][1] + f[i - 1][0] + 1) % 1000000007;
  }
  cout << (f[n][0] + f[n][1]) % 1000000007 << endl;
  return 0;
}
