#include <bits/stdc++.h>
using namespace std;
const long long mod = 1e9 + 7;
int main() {
  long long val[] = {0,      0, 0,       3, 0,         15, 0,          133LL, 0,
                     2025LL, 0, 37851LL, 0, 1030367LL, 0,  36362925LL, 0};
  long long F[20], ans[20];
  F[0] = 1LL;
  for (int i = 1; i <= 16; i++) {
    F[i] = F[i - 1] * (long long)i;
    F[i] %= mod;
  }
  for (int i = 0; i <= 16; i++) {
    val[i] %= mod;
  }
  for (int i = 0; i <= 16; i++) {
    ans[i] = val[i] * F[i];
    ans[i] %= mod;
  }
  ans[1] = 1LL;
  int n;
  cin >> n;
  cout << ans[n] << endl;
  return 0;
}
