#include <bits/stdc++.h>
#define REP(i,n,N) for(ll i=(n);i<N;i++)
#define p(s) cout<<(s)<<endl
typedef long long ll;
using namespace std;
const ll mod=1e9+7;
int main(){
	ll N;
	cin>>N;
	ll ans=1;
	REP(i,1,N){
		ans*=(i+1)*(2*i+1)%mod;
		ans%=mod;
	}
	p(ans);
	return 0;
}