#include <bits/stdc++.h>
const long long Mod = 1e9 + 7;
using namespace std;
long long n;
long long a[200010];
long long b[200010];
long long ans;
int main() {
  cin >> n;
  a[1] = a[0] = 1;
  ans = 1;
  for (int i = 2; i <= n; i++) a[i] = (Mod - Mod / i) * a[Mod % i] % Mod;
  for (int i = 1; i <= n; i++) ans = ans * a[i] % Mod * (n + i) % Mod;
  cout << ans - n;
  return 0;
}
