#include <bits/stdc++.h>
using namespace std;
int n;
long long p[2000000];
int ex(long long a) {
  if (a == 1) return 1;
  return (ex((1000000007 / a + 1) * a - 1000000007) * (1000000007 / a + 1) %
          1000000007);
}
int main() {
  scanf("%d", &n);
  if (n == 1) {
    printf("1");
    return 0;
  }
  p[1] = 1;
  for (int i = 2; i <= 2 * n; i++) p[i] = p[i - 1] * i % 1000000007;
  long long ans =
      p[2 * n - 1] * ex(p[n]) % 1000000007 * ex(p[n - 1]) % 1000000007;
  ans = ans * 2 - n + 1000000007;
  cout << ans % 1000000007;
  return 0;
}
