#include <bits/stdc++.h>
using namespace std;
const int INF = 2034567891;
const long long int INF64 = 1234567890123456789ll;
const long long int N = 500005;
const long long int MN = 100010;
inline bool isPowerOfTwo(int x) { return (x != 0 && (x & (x - 1)) == 0); }
inline int bits_count(int v) {
  v = v - ((v >> 1) & 0x55555555);
  v = (v & 0x33333333) + ((v >> 2) & 0x33333333);
  return ((v + (v >> 4) & 0xF0F0F0F) * 0x1010101) >> 24;
}
inline int bits_count(long long int v) {
  int t = v >> 32;
  int p = (v & ((1LL << 32) - 1));
  return bits_count(t) + bits_count(p);
}
unsigned int reverse_bits(register unsigned int x) {
  x = (((x & 0xaaaaaaaa) >> 1) | ((x & 0x55555555) << 1));
  x = (((x & 0xcccccccc) >> 2) | ((x & 0x33333333) << 2));
  x = (((x & 0xf0f0f0f0) >> 4) | ((x & 0x0f0f0f0f) << 4));
  x = (((x & 0xff00ff00) >> 8) | ((x & 0x00ff00ff) << 8));
  return ((x >> 16) | (x << 16));
}
inline int sign(int x) { return x > 0; }
inline string readln() {
  string _s;
  getline(cin, _s);
  return _s;
}
int gcd(int a, int b) { return (b == 0 ? a : gcd(b, a % b)); }
long long int lcm(int a, int b) { return (a * (b / gcd(a, b))); }
long long int max(long long int a, long long int b, long long int c) {
  return max(a, max(b, c));
}
template <class T>
string NTS(T Number) {
  stringstream ss;
  ss << Number;
  return ss.str();
}
string rev(string s) {
  reverse(s.begin(), s.end());
  return s;
}
long long int power(long long int x, long long int y) {
  long long int ans = 1;
  while (y > 0) {
    if (y & 1) ans = (ans * x) % 1000000007;
    x = (x * x) % 1000000007;
    y /= 2;
  }
  return ans;
}
inline int read() {
  int ret = 0, temp = 1;
  int c = getchar();
  while (c < '0' || c > '9') {
    c = getchar();
  }
  while (c >= '0' && c <= '9') {
    ret = (ret << 3) + (ret << 1) + c - '0';
    c = getchar();
  }
  return ret;
}
int main() {
  long long int n;
  cin >> n;
  long long int ans = 1;
  for (int i = 1; i <= n * 2 - 1; i++)
    ans = (ans * (long long int)i) % 1000000007;
  for (int i = 1; i <= n - 1; i++) {
    ans = (ans * power((long long int)i, 1000000007 - 2)) % 1000000007;
    ans = (ans * power((long long int)i, 1000000007 - 2)) % 1000000007;
  }
  ans = (ans * power(n, 1000000007 - 2)) % 1000000007;
  cout << (2 * ans - n + 1000000007) % 1000000007;
}
