#include <bits/stdc++.h>
using namespace std;
const long long mod = 1000000007LL;
long long a[] = {1, 3, 15, 133, 2025, 37851, 1030367, 36362925};
int n;
int main() {
  int i, j, k;
  cin >> n;
  if (n % 2 == 0) {
    puts("0");
    return 0;
  }
  int p = (n + 1) / 2 - 1;
  long long x = a[p];
  for (i = 1; i <= n; i++) {
    x *= (long long)i;
    x %= mod;
  }
  cout << x << endl;
  return 0;
}
