#include "bits/stdc++.h" #define REP(i,n,N) for(ll i=(n); i<(N); i++) #define RREP(i,n,N) for(ll i=(N-1); i>=n; i--) #define CK(n,a,b) ((a)<=(n)&&(n)<(b)) #define ALL(v) (v).begin(),(v).end() #define p(s) cout<<(s)<> typedef long long ll; using namespace std; const ll mod = 1e9+7; ll N; int main(){ cin>>N; ll ans=1; REP(i,2,2*N+1){ ans*=i; if(i%2==0) ans/=2; ans%=mod; } p(ans); return 0; }