#include <bits/stdc++.h>
using namespace std;
const int MAXN = 1e6 + 5;
const int INF = 1e9 + 7;
int dp[MAXN];
int MOD(int a) { return (((a % INF) + INF) % INF); }
int main() {
  int *a = new int[MAXN];
  long long sum[2] = {};
  int n;
  cin >> n;
  for (int i = 0; i < n; ++i) {
    int now = i & 1;
    dp[i] = 1 + sum[!now];
    sum[now] = MOD(sum[now] + dp[i]);
  }
  long long all = 0;
  for (int i = 0; i < n; ++i) {
    all = MOD(MOD(all) + MOD(dp[i]));
  }
  cout << all;
}
