#include <bits/stdc++.h>
using namespace std;
int n;
int inv(int a, long long m) {
  int p = 1, q = 0, b = m, c, d;
  while (b > 0) {
    c = a / b;
    d = a;
    a = b;
    b = d % b;
    d = p;
    p = q;
    q = d - c * q;
  }
  return p < 0 ? p + m : p;
}
long long ksm(int a, int b) {
  long long res = 1;
  long long k = a;
  while (b) {
    if (b & 1) {
      res = res * k % 1000000007;
    }
    k = k * k % 1000000007;
    b >>= 1;
  }
  return res;
}
long long a[2000005];
int main() {
  long long sum, res;
  cin >> n;
  sum = (ksm(2, n + 1) - 1 + 1000000007) % 1000000007;
  res = ksm(2, n);
  a[n] = 1;
  for (int i = n + 1; i <= 2 * n; i++) {
    a[i] = (a[i - 1] * i % 1000000007) * inv(i - n, 1000000007) % 1000000007;
    res = (2 * res - 2 * a[i - 1] + 1000000007 * 2) % 1000000007;
    sum = (sum + res) % 1000000007;
  }
  printf("%lld\n", sum);
  return 0;
}
