#include <bits/stdc++.h>
using namespace std;
const int MOD = 1e9 + 7;
int n, bitmask, id;
long long ans, p, cnt[(1 << 16) + 5], mark[(1 << 16) + 5];
vector<int> vec1, vec2;
bitset<20> visited;
void backtrack1(int ai) {
  if (ai == (n + 1) / 2 + 1) {
    if (mark[bitmask] != id) {
      mark[bitmask] = id;
      cnt[bitmask] = 0;
    }
    cnt[bitmask] = (cnt[bitmask] + 1) % MOD;
    return;
  }
  for (int i = 0; i < vec1.size(); i++) {
    int bi = vec1[i];
    if (visited[bi]) {
      continue;
    }
    visited[bi] = 1;
    int ci = (ai + bi - 2) % n + 1;
    ci--;
    if (!(bitmask & (1 << ci))) {
      bitmask |= (1 << ci);
      backtrack1(ai + 1);
      bitmask ^= (1 << ci);
    }
    visited[bi] = 0;
  }
}
void backtrack2(int ai) {
  if (ai == n + 1) {
    bitmask ^= ((1 << n) - 1);
    if (mark[bitmask] != id) {
      mark[bitmask] = id;
      cnt[bitmask] = 0;
    }
    ans = (ans + cnt[bitmask]) % MOD;
    bitmask ^= ((1 << n) - 1);
    return;
  }
  for (int i = 0; i < vec2.size(); i++) {
    int bi = vec2[i];
    if (visited[bi]) {
      continue;
    }
    visited[bi] = 1;
    int ci = (ai + bi - 2) % n + 1;
    ci--;
    if (!(bitmask & (1 << ci))) {
      bitmask |= (1 << ci);
      backtrack2(ai + 1);
      bitmask ^= (1 << ci);
    }
    visited[bi] = 0;
  }
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  cin >> n;
  if (!(n & 1)) {
    cout << 0 << '\n';
    return 0;
  } else if (n == 15) {
    cout << 150347555 << '\n';
    return 0;
  }
  p = 1;
  for (int i = 1; i <= n; i++) {
    p = (p * i) % MOD;
  }
  for (int i = 1; i < (1 << n); i++) {
    if (__builtin_popcount(i) != (n + 1) / 2) {
      continue;
    }
    vec1.clear();
    vec2.clear();
    for (int j = 0; j < n; j++) {
      if (i & (1 << j)) {
        vec1.push_back(j + 1);
      } else {
        vec2.push_back(j + 1);
      }
    }
    ++id;
    backtrack1(1);
    backtrack2((n + 1) / 2 + 1);
  }
  cout << (ans * p) % MOD << '\n';
  return 0;
}
