#include <bits/stdc++.h>
using namespace std;
int row[16];
int col[16];
long long sel(int num, int n) {
  if (num == n - 1) return 1;
  long long ans = 0;
  int r = num;
  int I;
  int J;
  for (int i = 0; i < n; i++) {
    if (!col[i] && !row[r]) {
      col[i] = 1;
      row[r] = 1;
      ans = ans + sel(num + 1, n);
      col[i] = 0;
      row[r] = 0;
    }
    r--;
    r = r + n;
    r = r % n;
  }
  return ans;
}
long long arr1[] = {0,    1, 0,     3, 0,       15, 0,        133, 0,
                    2025, 0, 37851, 0, 1030367, 0,  36362925, 0};
int main() {
  int n;
  cin >> n;
  if (n % 2 == 0) {
    cout << 0;
    return 0;
  }
  long long ans = 1;
  for (int i = 1; i <= n; i++) {
    ans = ans * i;
    ans = ans % 1000000007;
  }
  ans = ans * arr1[n];
  ans = ans % 1000000007;
  cout << ans;
}
