#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
using namespace std;
const long double pi = acos(-1);
const long long int mod = 1e9 + 7;
bool debug = false;
long long int dx[] = {0, 1, 0, -1};
long long int dy[] = {1, 0, -1, 0};
bool sortbysec(pair<long long int, long long int> a,
               pair<long long int, long long int> b) {
  return (a.second < b.second);
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  ;
  long long int t = 1, n, i, j, k, len, x, y, z, c, f, flag, p, q, mx, mn, l, r,
                sum, ans, tmp, it, pos, avg, m, cnt;
  string s;
  char ch;
  vector<long long int> v;
  vector<pair<long long int, long long int>> vec;
  unordered_map<long long int, long long int> mappu;
  pair<long long int, long long int> pr;
  {
    f = 0;
    sum = 0;
    flag = 0;
    ans = 0;
    cnt = 0;
    v.clear();
    mappu.clear();
    vec.clear();
    cin >> n;
    long long int a[1 + n];
    for (i = 1; i <= n; i++) a[i] = (i & 1) ? 1 : 0;
    long long int dp1[n + 2], dp0[n + 2];
    memset(dp1, 0, sizeof(dp1));
    memset(dp0, 0, sizeof(dp0));
    for (i = 1; i <= n; i++) {
      dp1[i] = dp1[i - 1];
      dp0[i] = dp0[i - 1];
      if (a[i] == 1) {
        dp1[i] = dp1[i] + dp0[i - 1] + 1;
        dp1[i] %= mod;
      } else {
        dp0[i] = dp0[i] + dp1[i - 1] + 1;
        dp0[i] %= mod;
      }
    }
    ans = max(1LL, dp0[n] + dp1[n]);
    cout << ans % mod << "\n";
  }
  return 0;
}
