#include <bits/stdc++.h>
using namespace std;
map<pair<int, int>, int> mp;
int Tar, n, Ans;
void dfs1(int x, int a, int b) {
  if (x > Tar) {
    mp[make_pair(a, b)]++;
    return;
  }
  int i, j;
  for (i = 1; i <= n; i++) {
    if (((a >> (i - 1)) & 1) == 1) {
      continue;
    }
    j = x - i + 1;
    if (j > 0 && ((b >> (j - 1)) & 1) == 0) {
      dfs1(x + 1, a | (1 << (i - 1)), b | (1 << (j - 1)));
    }
    j = x - i + 1 + n;
    if (j <= n && ((b >> (j - 1)) & 1) == 0) {
      dfs1(x + 1, a | (1 << (i - 1)), b | (1 << (j - 1)));
    }
  }
}
void dfs2(int x, int a, int b) {
  if (x > Tar) {
    int ta = ((1 << n) - 1) ^ a, tb = ((1 << n) - 1) ^ b;
    Ans = (Ans + mp[make_pair(ta, tb)]) % 1000000007;
    return;
  }
  int i, j;
  for (i = 1; i <= n; i++) {
    if (((a >> (i - 1)) & 1) == 1) {
      continue;
    }
    j = x - i + 1;
    if (j > 0 && ((b >> (j - 1)) & 1) == 0) {
      dfs2(x + 1, a | (1 << (i - 1)), b | (1 << (j - 1)));
    }
    j = x - i + 1 + n;
    if (j <= n && ((b >> (j - 1)) & 1) == 0) {
      dfs2(x + 1, a | (1 << (i - 1)), b | (1 << (j - 1)));
    }
  }
}
int ans[17] = {0, 1,         0, 18,        0, 1800,
               0, 670320,    0, 734832000, 0, 890786230,
               0, 695720788, 0, 150347555, 0};
int main() {
  scanf("%d", &n);
  printf("%d\n", ans[n]);
  return 0;
  if (n == 1) {
    printf("1\n");
  } else if ((n & 1) == 0) {
    printf("0\n");
  } else {
    Tar = n / 2;
    dfs1(1, 0, 0);
    Tar = n;
    dfs2(n / 2 + 1, 0, 0);
    int i;
    for (i = 1; i <= n; i++) {
      Ans = (1LL * Ans * i) % 1000000007;
    }
    printf("%d\n", Ans);
  }
  return 0;
}
