#include <bits/stdc++.h>
using namespace std;
long long int fact[200001];
long long int power(long long int x, int y) {
  if (y == 0) return 1;
  long long int d = power(x, y / 2) % 1000000007;
  if (y % 2 == 0)
    return (d * d) % 1000000007;
  else
    return (((x * d) % 1000000007) * d) % 1000000007;
}
long long int moddiv(long long int num, long long int den) {
  long long int d_m = power(den, 1000000007 - 2);
  return (num * d_m) % 1000000007;
}
long long int ncr(long long int n, long long int r) {
  long long int num = fact[n];
  long long int den = (fact[n - r] * fact[r]) % 1000000007;
  return moddiv(num, den);
}
long long int arr[100001];
void solve(int t) {
  fact[0] = 1;
  for (int i = 1; i < 200001; i++) fact[i] = (i * fact[i - 1]) % 1000000007;
  long long int n;
  scanf("%lld", &n);
  long long int ans = 0;
  ans = (2 * ncr(2 * n - 1, n)) % 1000000007;
  ans = (ans - n + 1000000007) % 1000000007;
  cout << ans << endl;
}
int main() {
  int t;
  t = 1;
  for (int i = 0; i < t; i++) solve(i);
}
