#include <bits/stdc++.h>
using namespace std;
int INP, AM, REACHEOF;
char BUF[(1 << 12) + 1], *inp = BUF;
const long double PI = acos((long double)-1.0);
const int res[] = {1, 3, 15, 133, 2025, 37851, 1030367, 36362925};
int main() {
  int n;
  while (cin >> n) {
    if (n % 2 == 0)
      cout << 0 << endl;
    else {
      long long t = res[n / 2];
      for (int i = (1), _b = (n); i <= _b; i++) t = (t * i) % 1000000007;
      cout << t << endl;
    }
  }
  return 0;
}
