87pts！！！

#include<bits/stdc++.h>
using namespace std;
int a[20],b1[20],b2[20],b3[20],ans=0,n;
void dfs(int hang){
    if(hang>n){
        ans++;
        if(ans<=3){
            for(int i=1;i<=n;i++){
                cout<<a[i]<<" ";
            }
            cout<<endl;
        }
        return;
    }
    for(int i=1;i<=n;i++){
        if(b1[i]==0&&b2[hang+i]==0&&b3[hang-i+n]==0){
            a[hang]=i;
            b1[i]=1;
            b2[hang+i]=1;
            b3[hang-i+n]=1;
            dfs(hang+1);
            b1[i]=0;
            b2[hang+i]=0;
            b3[hang-i+n]=0;
        }
    }
}
int main(){
    cin>>n;
    dfs(1);
    cout<<ans;
    return 0;
}