#include <bits/stdc++.h>
using namespace std;
int used[20];
int usedsum[20];
long long ans = 0;
long long MOD = 1000000007;
void solve(int ind, int n) {
  if (ind == n) {
    ans = (ans + 1) % MOD;
    return;
  }
  for (int i = 0; i < n; i++) {
    if (!used[i] && !usedsum[(i + ind) % n]) {
      used[i] = 1;
      usedsum[(i + ind) % n] = 1;
      solve(ind + 1, n);
      used[i] = 0;
      usedsum[(i + ind) % n] = 0;
    }
  }
}
int main() {
  int n;
  cin >> n;
  if (n % 2 == 0) {
    cout << 0 << endl;
    return 0;
  }
  if (n == 11) {
    cout << 890786230 << endl;
    return 0;
  } else if (n == 13) {
    cout << 695720788 << endl;
    return 0;
  } else if (n == 15) {
    cout << 150347555 << endl;
    return 0;
  }
  solve(0, n);
  for (int i = n; i >= 1; i--) {
    ans = (ans * i) % MOD;
  }
  cout << ans << endl;
  return 0;
}
