#include <bits/stdc++.h>
using namespace std;
int main() {
  int n;
  cin >> n;
  long long mult[] = {1,
                      3,
                      15,
                      133,
                      2025,
                      37851,
                      1030367,
                      36362925,
                      1606008513,
                      87656896891,
                      5778121715415,
                      452794797220965,
                      41609568918940625};
  if (n % 2 == 0) {
    cout << 0;
    return 0;
  }
  long long MOD = 1000 * 1000 * 1000 + 7;
  long long f = 1;
  for (int i = 0; i < 13; i++) mult[i] %= MOD;
  for (long long i = 1; i <= n; i++) f = (f * i) % MOD;
  long long ans = f * mult[(n - 1) / 2] % MOD;
  cout << ans;
  return 0;
}
