#include<iostream.h>
#include<stdio.h>
#include<math.h>
#include<conio.h>
int *col,n,k=1;
int promising(int);
void queens(int i)
{
	int j;
	if(promising(i))
	if (i==n)
	{
		if (k==2) //if this line and next line removed it print all avalable state 
		return;   // 
		printf("the reason %d is: ",k);
		k++;
		for(int index=1;index<=n;index++)
			cout<<col[index]<<"  ";
		cout<<endl;
	}
	else
		for(j=1;j<=n;j++)
		{
			col[i+1] = j;
			queens(i+1) ;
		}
}

int promising(int i)
{
	int k;
	int myswitch;
	k=1;
	myswitch = 1;
	while (k<i && myswitch)
	{
		if(col[i]==col[k]||abs(col[i]-col[k])==(i-k))
		myswitch = 0;
		k++;
	}
	return myswitch;
}

void main()
{
	printf("Enter Number Of Queens\n");
	cin>>n;
	col=new int[n];
	queens(0);
	getch();
}