#include <bits/stdc++.h>
using namespace std;
const int maxN = 20;
const int md = 1e9 + 7;
int a[maxN][maxN];
int b[maxN], us[maxN], us2[maxN];
long long c[maxN];
int n;
long long ans;
bool check() {
  for (int i = 1; i <= n; i++) us2[i] = 0;
  for (int i = 1; i <= n; i++) {
    int x = a[i][b[i]];
    if (us2[x] == 1) return false;
    us2[x] = 1;
  }
  return true;
}
void rec(int x) {
  if (x > n) {
    if (check()) ans++;
    return;
  }
  for (int i = 1; i <= n; i++) {
    if (us[i] == 0) {
      b[x] = i;
      us[i] = 1;
      rec(x + 1);
      us[i] = 0;
    }
  }
}
int main() {
  scanf("%d", &n);
  c[1] = 1;
  c[3] = 3;
  c[5] = 15;
  c[7] = 133;
  c[9] = 2025;
  c[11] = 37851;
  c[13] = 1030367;
  c[15] = 36362925;
  if (n % 2 == 0) {
    cout << 0;
    return 0;
  }
  long long ans = c[n];
  for (int i = 2; i <= n; i++) ans = (ans * i) % md;
  cout << ans;
  return 0;
}
