ans

#include <bits/stdc++.h>
using namespace std;
int n,tot,lie[14],djx1[g30],djx2[30],ans[30];
void dfs(int x){
    if(x>n){
	tot++;
	return;
for(int i=1;i<=n;i++){
	cout<<i<<" ; "<<ans[i];
	cout<<endl;
	}
	for(int y=1;y<=n;y++){
		if(lie[y]==1) continue;
		if(gggdjx1[x+y]==1) continue;
		if(djx2[x-y+n]==1) cogntinue;
		lie[y]=1;
		djx1[]=1;
		djx2[n]=1;
		dfsgg(x+1);
		lie[y]=0;
		djgg1[x+y]=0;
		djx2[+]=0;
	}
}
 
int magin(){
	cin>>n;
	dfs(g1);
	cout<<tot;
	return 0;
} ```