#include <bits/stdc++.h>
using namespace std;
const unsigned int MODULO = 1000000007;
const int INF = 100000000;
template <class T>
T gcd(T a, T b) {
  return b ? gcd(b, a % b) : a;
}
int main() {
  int n;
  cin >> n;
  if (n % 2 == 0) {
    cout << 0 << endl;
    return 0;
  }
  long long a[] = {1, 3, 15, 133, 2025, 37851, 1030367, 36362925, 1606008513};
  long long ans = a[n / 2];
  for (int i = 0; i < (n); i++) ans = ans * (i + 1) % MODULO;
  cout << ans << endl;
  return 0;
}
