#include <bits/stdc++.h>
using namespace std;
const int MAX = 1e5;
const int MV = 1e5;
const int INF = 2e9;
const int MOD = 1e9 + 7;
long long ANS;
int n;
long long fac[2 * MAX + 10], p[2 * MAX + 10];
long long po(long long x, long long y) {
  if (y == 0) return 1;
  long long tmp = po(x, y / 2);
  tmp = (tmp * tmp) % MOD;
  if (y % 2 == 1) tmp = (tmp * x) % MOD;
  return tmp;
}
long long bino(int m, int c) {
  long long tmp = (p[c] * p[m - c]) % MOD;
  tmp = (tmp * fac[m]) % MOD;
  return tmp % MOD;
}
int32_t main() {
  ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
  cin >> n;
  if (n == 1) return cout << 1, 0;
  fac[0] = 1;
  for (long long i = 1; i <= n + n; i++) fac[i] = (fac[i - 1] * i) % MOD;
  for (long long i = 1; i <= n + n; i++) p[i] = po(fac[i], MOD - 2);
  ANS = bino(2 * n - 1, n - 1);
  ANS = (ANS + ANS) % MOD;
  ANS = (ANS - n) % MOD;
  if (ANS < 0) ANS += MOD;
  cout << ANS << "\n";
  return 0;
}
