Permutation *p* is an ordered set of integers *p*<sub class="lower-index">1</sub>,  *p*<sub class="lower-index">2</sub>,  ...,  *p*<sub class="lower-index">*n*</sub>, consisting of *n* distinct positive integers, each of them doesn't exceed *n*. We'll denote the *i*-th element of permutation *p* as *p*<sub class="lower-index">*i*</sub>. We'll call number *n* the size or the length of permutation *p*<sub class="lower-index">1</sub>,  *p*<sub class="lower-index">2</sub>,  ...,  *p*<sub class="lower-index">*n*</sub>.

Petya decided to introduce the sum operation on the set of permutations of length *n*. Let's assume that we are given two permutations of length *n*: *a*<sub class="lower-index">1</sub>, *a*<sub class="lower-index">2</sub>, ..., *a*<sub class="lower-index">*n*</sub> and *b*<sub class="lower-index">1</sub>, *b*<sub class="lower-index">2</sub>, ..., *b*<sub class="lower-index">*n*</sub>. Petya calls the sum of permutations *a* and *b* such permutation *c* of length *n*, where *c*<sub class="lower-index">*i*</sub> = ((*a*<sub class="lower-index">*i*</sub> - 1 + *b*<sub class="lower-index">*i*</sub> - 1) *mod* *n*) + 1 (1 ≤ *i* ≤ *n*).

Operation <img align="middle" class="tex-formula" src="https://espresso.codeforces.com/1d533a6df05afe2c303e325bb11b740c58acf6da.png" style="max-width: 100.0%;max-height: 100.0%;"/> means taking the remainder after dividing number *x* by number *y*.

Obviously, not for all permutations *a* and *b* exists permutation *c* that is sum of *a* and *b*. That's why Petya got sad and asked you to do the following: given *n*, count the number of such pairs of permutations *a* and *b* of length *n*, that exists permutation *c* that is sum of *a* and *b*. The pair of permutations *x*, *y* (*x* ≠ *y*) and the pair of permutations *y*, *x* are considered distinct pairs.

As the answer can be rather large, print the remainder after dividing it by 1000000007 (10<sup class="upper-index">9</sup> + 7).
The single line contains integer *n* (1 ≤ *n* ≤ 16).
p   = int(1e9+7)
T   = [0,1,0,3,0,15,0,133,0,2025,0,37851,0,1030367]

n    = int(input())
fact = T[n]
for i in range(2,n+1):
    fact = fact*i%p
print(fact)
