#include <bits/stdc++.h>
using namespace std;
const double EPS = 1e-15, PI = acos(-1);
const int mod = int(1e9) + 7, MX = int(1e6) + 20;
inline long long gcd(long long a, long long b) {
  return !b ? a : gcd(b, a % b);
}
inline long long lcm(long long a, long long b) { return a * (b / gcd(a, b)); }
int n,
    pre[] = {0,         1, 0,         18, 0,         1800, 0,         670320, 0,
             734832000, 0, 890786230, 0,  695720788, 0,    150347555, 0};
void solve() {
  scanf("%d", &n);
  printf("%d\n", pre[n]);
}
int main() { solve(); }
