#include <bits/stdc++.h>
using namespace std;
const int inf = (int)1e9;
const int mod = (int)1e9 + 7;
const double pi = acos(-1.0);
const double eps = 1e-9;
long long fact[1005];
long long ans[8] = {1, 3, 15, 133, 2025, 37851, 1030367, 36362925};
int main() {
  fact[0] = 1;
  for (int i = 1; i < 1005; i++) fact[i] = i * fact[i - 1];
  int n;
  scanf("%d", &n);
  if (n & 1)
    printf("%d\n", ans[n / 2] % mod * 1ll * (fact[n] % mod) % mod);
  else
    printf("%d\n", 0);
  return 0;
}
