八皇后

#include<bits/stdc++.h>
using namespace std;

int n;
int ans[14];
int cnt;
int col[100], dig1[100], dig2[100];

void myPrint(){
  cnt++;
  if(cnt <= 3){
    for(int i=1; i<=n; i++)
      cout << ans[i] << " ";
    cout << endl;
  }
}

void dfs(int r){
  if(r > n){
    myPrint();
    return;
  }

  for(int i=1; i<=n; i++){
    if( !col[i] && !dig1[r-i+n] && !dig2[r+i] ){
      ans[r] = i;
      col[i] = 1;
      dig1[r-i+n] = 1;
      dig2[r+i] = 1;
      dfs(r+1);
      col[i] = 0;
      dig1[r-i+n] = 0;
      dig2[r+i] = 0;
    }
  }
}

int main(){
  ios::sync_with_stdio(1);

  cin >> n;
  dfs(1);
  cout << cnt;

  return 0;
}