#include<bits/stdc++.h>
using namespace std;
long long n,ans,a[15],cnt;
bool l[15],djx1[15],djx2[15];
void cout_()
{
    for(int i=1; i<=n; i++)
    {
        cout<<a[i]<<" ";
    }
    cout<<"\n";
}
void dog(int i)
{
    if(i>n)
    {
        if(ans<3)
        {
            cout_();
        }
        ans++;
        return ;
    }
    for(int j=1; j<=n; j++)
    {
        if(l[j]==0&&djx1[i+j]==0&&djx2[i-j+n]==0)
        {
            l[j]=1;
            djx1[i+j]=1;
            djx2[i-j+n]=1;
            a[i]=j;
            dog(i+1);
            l[j]=0;
            djx1[i+j]=0;
            djx2[i-j+n]=0;
        }
    }
}
int main(){
    cin>>n;
    dog(1);
    cout<<ans<<endl;
    
    return 0;
}

下载了样例，测过，没问题，提交上去3AC，其他WA