#include <bits/stdc++.h>
using namespace std;
const int INF = 0x20000000;
const long long int MOD = 1000000007;
const long long int m = 1000000007;
long long int powmod(long long int a, long long int b) {
  long long int res = 1;
  for (int i = 63; i >= 0; i--) {
    res = (res * res) % m;
    if (((i > 0 ? ((unsigned long long int)2 << (i - 1)) : 1) & b) != 0)
      res = (res * a) % m;
  }
  return res % m;
}
int extgcd(int a, int b, int &x, int &y) {
  int g = a;
  x = 1;
  y = 0;
  if (b != 0) g = extgcd(b, a % b, y, x), y -= (a / b) * x;
  return g;
}
int inv(int a) {
  int x, y;
  extgcd(a, m, x, y);
  return (m + x % m) % m;
}
long long int inv(long long int a) { return powmod(a, MOD - 2); }
long long int comb(long long int a, long long int b) {
  if (b < 0 || b > a) return 0;
  long long int res = 1;
  for (int i = 1; i <= a; i++) res = (res * i) % MOD;
  for (int i = 1; i <= b; i++) res = (res * inv(i)) % MOD;
  for (int i = 1; i <= a - b; i++) res = (res * inv(i)) % MOD;
  return res;
}
int main() {
  long long int n;
  cin >> n;
  cout << ((long long int)comb(n * 2 - 1, n) * 2 - n + m) % m << endl;
  return 0;
}
