#include <bits/stdc++.h>
int const N = 2 * 1e5 + 5;
using namespace std;
long long n, fact[N], inv[N];
long long fp(long long x, long long y) {
  if (!y) return 1;
  long long res = fp(x, y / 2);
  res = (res * res) % 1000000007;
  if (y & 1) return (res * x) % 1000000007;
  return res;
}
void solve() {
  fact[0] = inv[0] = 1;
  for (int i = 1; i < N; i++) {
    fact[i] = (fact[i - 1] * i) % 1000000007;
    inv[i] = fp(fact[i], 1000000007 - 2) % 1000000007;
  }
}
long long ncr(long long n, long long r) {
  return (((fact[n] * inv[n - r]) % 1000000007) * inv[r]) % 1000000007;
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  solve();
  cin >> n;
  cout << (2 * ncr(2 * n - 1, n - 1) - n) % 1000000007;
  return 0;
}
