#include<bits/stdc++.h>
using namespace std;
const int p=1e9+7;
#define int long long
int n;
int cnt;
int ans[10005][2];
int b[10005];
int rd[10005],cd[10005];
void dfs(int k){
    if(k==n+1){
        cnt++;
        cnt%=p;
    }
    for(int i=1;i<=n;i++){
        if(i==k) continue;
        if(rd[i]==2) continue;
        for(int j=i+1;j<=n;j++){
            if(j==k) continue;
            if(rd[j]==2) continue;
            rd[i]++;
            rd[j]++;
            ans[k][0]=i;
            ans[k][1]=j;
            dfs(k+1);
            rd[i]--;
            rd[j]--;
        }
        
    }
}
signed main(){
    freopen("graph.in","r",stdin);
    freopen("graph.out","w",stdout);
    cin>>n;
    dfs(1);
    cout<<cnt;
    return 0;
}