1 #include <bits/stdc++.h>
 2 using namespace std;
 3
 4 #define rep(i,l,r) for(int i=l;i<=r;++i)
 5 #define per(i,r,l) for(int i=r;i>=l;--i)
 6 #define mp make_pair
 7 #define fir first
 8 #define sec second
 9
10 typedef  long long ll;
11 typedef pair<int,int> pii;
12
13 const int p=1000000007,V=1e6+3;
14
15 int n,full,semi,turn[V];
16 map<pii,int>f[2];
17 map<pii,int>::iterator it;
18
19 int rev(int j){//j循环右移1位
20     int ans=0;
21     if(j>=semi){
22         ans=1;
23         j-=semi;
24     }
25
26     return ans|(j<<1);
27 }
28
29 int main(){
30     scanf("%d",&n);
31
32     if(n==1){
33         printf("1");
34         return 0;
35     }
36
37     if(n%2==0){
38         printf("0");
39         return 0;
40     }
41
42     full=(1<<n)-1;
43     semi=(1<<(n-1));
44
45
46     int u=(n>>1);
47
48     f[0][mp(0,0)]=1;
49
50     //多出的一维[0/1]是在愚蠢地省空间...
51     bool oi=0;
52     rep(o,0,u){
53         f[!oi].clear();
54
55         for(it=f[oi].begin();it!=f[oi].end();++it){
56             pii P=it->fir;int val=it->sec;
57             int L=P.fir,R=P.sec;
58
59             int j=(L|R);
60             if(j==full) continue;
61
62             rep(i,0,n-1) if( ( (1<<i)&L ) ==0  && ( (1<<i)&R ) ==0  )
63                 (f[!oi][mp( ( L|(1<<i) ) , rev( R|(1<<i) ) )]+=val)%=p;
64
65         }
66
67         oi=!oi;
68     }
69
70     int pre=(1<<(u+1))-1,suf=full^pre;
71     rep(i,1,full) turn[i]=((i&pre)<<u)|((i&suf)>>(u+1));
72     //turn[i]即i循环右移(n/2)位
73
74     ll ans=0;
75     for(it=f[oi].begin();it!=f[oi].end();++it){
76         pii P=it->fir;ll val=it->sec;
77         int L=P.fir,R=P.sec;
78
79         (ans+=val*f[!oi][mp(full^L,turn[full^R])]%p)%=p;
80     }
81
82     rep(i,1,n) (ans*=i)%=p;
83
84     printf("%lld",ans);
85
86     return 0;
87 }