#include <bits/stdc++.h>
long long dp[20];
long long magic[20] = {0,    1, 0,     3, 0,       15, 0,        133, 0,
                       2025, 0, 37851, 0, 1030367, 0,  36362925, 0};
long long factorial[20] = {1, 1, 2};
int main() {
  long long MOD = 1000000007;
  int i, n;
  for (i = 1; i <= 16; i++) {
    factorial[i] = (factorial[i - 1] * i) % MOD;
    dp[i] = (magic[i] * factorial[i]) % MOD;
  }
  while (~scanf("%d", &n)) printf("%I64d\n", dp[n]);
  return 0;
}
