#include<iostream>

#include<cstdio>

#include<algorithm>

#include<cstring>

using namespace std;

const int N=;

int n,vis[][N<<],c[N],ans=;

void dfs(int cur){

    if(cur==n+){

        ans++;

        if(ans>) return;

        for(int i=;i<=n;i++) printf("%d ",c[i]); printf("\n");

        return;

    }

    for(int i=;i<=n;i++){

        if(!vis[][i]&&!vis[][i+cur]&&!vis[][cur-i+n]){

            vis[][i]=vis[][i+cur]=vis[][cur-i+n]=;

            c[cur]=i;

            dfs(cur+);

            vis[][i]=vis[][i+cur]=vis[][cur-i+n]=;

        }

    }

}

int main(){

    cin>>n;

    dfs();printf("%d",ans);

    return ;

}