#include <bits/stdc++.h>
using namespace std;
const int MAXN = (int)(1e5) + 100;
const int INF = (1 << 30);
const double PI = acos(-1.0);
const double EPS = (1e-6);
const int mod = 1000 * 1000 * 1000 + 7;
int main() {
  int n;
  cin >> n;
  if (n % 2 == 0) {
    cout << 0;
    return 0;
  }
  int precalc[] = {3, 15, 133, 2025, 37851, 1030367, 36362925, 1606008513};
  long long ans = 1;
  for (int i = 1; i <= n; i++) ans = (ans * i) % mod;
  ans = (ans * precalc[n / 2 - 1]) % mod;
  cout << ans;
  return 0;
}
