#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cstring>

#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
#include <map>
#include <set>

#include <functional>
#include <cassert>

typedef long long ll;
using namespace std;

#define debug(x) cerr << #x << " = " << (x) << endl;


#define mod 1000000007 //1e9+7(prime number)
#define INF 1000000000 //1e9
#define LLINF 2000000000000000000LL //2e18
#define SIZE 20000010

ll power(int k,int n,int M){
  if(n==0) return 1;
  if(n==1) return (ll)k;
  
  ll ret = power(k,n/2,M);
  
  ret=(ret*ret)%M;
  
  if(n%2==1)
    ret=(ret*k)%M;
  
  return ret;
}

int main(){
  int n;
  
  cin >> n;

  ll ans = 1;
  
  for(int i=1;i<=n*2;i++){
    ans = (ans*i)%mod;
  }

  ll p = power(2,mod-2, mod);
  
  for(int i=0;i<n;i++){
    ans = (ans * p)%mod;
  }

  cout << ans << endl;
  
  return 0;
}