class Solution {
vector[HTML_REMOVED]> ans;
int x[20];
public:
/*
* @param n: The number of queens
* @return: All distinct solutions
* we will sort your return value in output
/
bool valid(int i,int j){
if(i==0) return true;
int k=0;
while(k[HTML_REMOVED]> s;
for(int i=0;i[HTML_REMOVED]=n){
disp(n);
}
else{
for(int j=i;j[HTML_REMOVED]> solveNQueens(int n) {
// write your code here
for(int i=0;i<n;i++) x[i]=i;
dfs(0,n);
//return ans;
}
};