#include<bits/stdc++.h>
#define rep(i,a,b) for(int i=(a),_=(b);i<=_;++i)
#define per(i,a,b) for(int i=(a),_=(b);i>=_;--i)
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define size(x) int(x.size())
using namespace std;

typedef long long ll;
typedef unsigned int ui;
typedef unsigned long long ul;
typedef __int128 LL;
typedef __uint128_t UL;
typedef double db;
typedef vector<int> VI;

const int mod=1e9+7;
int inc(int x,int y){return x+=y-mod,x+=x>>31&mod;}
int dec(int x,int y){return x-=y,x+=x>>31&mod;}
int mul(int x,int y){return ul(x)*y%mod;}
int inc2(int &x,int y){return x+=y-mod,x+=x>>31&mod;}
int dec2(int &x,int y){return x-=y,x+=x>>31&mod;}
int mul2(int &x,int y){return x=ul(x)*y%mod;}
int qpow(int x,int y){int z=1;for(;y;y>>=1,x=mul(x,x))if(y&1)z=mul(x,z);return z;}

const int N=1e5+10;
int n,ff[N];

/*
bool vis[N];

int ans;

void dfs(int x,int mx,int cnt){
	if(vis[x])return dfs(x+1,mx,cnt);
	if(x==n+1){
		ans+=cnt==1;
		return;
	}
	rep(i,x+1,n)if(!vis[i]){
		vis[i]=1;
		dfs(x+1,max(mx,x+i),mx==x+i?cnt+1:(mx>x+i?cnt:1));
		vis[i]=0;
	}
}
*/

int main(){
	scanf("%d",&n);
	ff[0]=1;
	rep(i,1,n)ff[i]=mul(ff[i-1],2*i-1);
	n*=2;
	int x=0;
	rep(i,n+1,2*n-1){
		inc2(x,mul(mul((2*n+1-i)/2,qpow(i-1-n,n-(i+1)/2)),ff[(n>>1)-(n-(i+1)/2+1)]));
	}
	printf("%d\n",mul(x,qpow(ff[n>>1],mod-2)));
	exit(0);
}