#include <bits/stdc++.h>
using namespace std;
const int MAXN = 18;
const int MOD = (int)(1e9 + 7);
int N;
long long cnt = 0;
long long fact[MAXN];
long long secv[] = {1, 3, 15, 133, 2025, 37851, 1030367, 36362925, 1606008513};
int main() {
  fact[0] = 1;
  for (int i = 1; i <= MAXN; ++i) fact[i] = (fact[i - 1] * i) % MOD;
  scanf("%d", &N);
  int id = N / 2;
  long long res = (secv[id] * fact[N]) % MOD;
  if (N % 2 == 0)
    cout << 0 << endl;
  else
    cout << res << endl;
  return 0;
}
