// includes #include <cstdio> #include <cstdint> #include <iostream> #include <iomanip> #include <string> #include <queue> #include <stack> #include <vector> #include <set> #include <map> #include <unordered_map> #include <algorithm> #include <utility> #include <functional> #include <cmath> #include <climits> #include <bitset> #include <list> #include <random> // macros #define ll long long int #define pb emplace_back #define mk make_pair #define pq priority_queue #define FOR(i, a, b) for(int i=(a);i<(b);++i) #define rep(i, n) FOR(i, 0, n) #define rrep(i, n) for(int i=((int)(n)-1);i>=0;i--) #define all(x) (x).begin(),(x).end() #define sz(x) ((int)(x).size()) #define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end()) using namespace std; // types typedef pair<int, int> P; typedef pair<ll, int> Pl; typedef pair<ll, ll> Pll; typedef pair<double, double> Pd; // constants const int inf = 1e9; const ll linf = 1LL << 50; const double EPS = 1e-10; const int mod = 1e9 + 7; // solve template <class T>bool chmax(T &a, const T &b){if(a < b){a = b; return 1;} return 0;} template <class T>bool chmin(T &a, const T &b){if(a > b){a = b; return 1;} return 0;} //ll dp[10001][10001]; ll fac[1000001]; int main(int argc, char const* argv[]) { ios_base::sync_with_stdio(false); cin.tie(0); int n; cin >> n; fac[0] = 1; for(int i = 1; i < 1000001; i++)fac[i] = fac[i-1] * i % mod; /*if(n > 10000)return 0; dp[0][0] = 1; for(int i = 1; i <= n; i++){ for(int j = 0; j <= i; j++){ if(j > 0)dp[i][j] = (dp[i-1][j] + dp[i][j-1] * (i - j + 1) % mod) % mod; else dp[i][j] = dp[i-1][j]; } } for(int i = 1; i < 20; i++)cout << i << " " << dp[i][i] << endl; cout << (dp[n][n] * fac[n] % mod) * fac[n] % mod << endl; */ ll res = 1; for(int i = 0; i < n; i++){ res = (res * (2 * i + 1)) % mod; } cout << res * (fac[n] * fac[n] % mod) % mod << endl; return 0; }