N Queens

You are given an integer N, and for a given N x N chessboard, find a way to place N queens such that no queen can attack any other queen on the chessboard.

A queen can be killed when it lies in the same row, or same column, or the same diagonal of any of the other queens. You have to print all such configurations.

Input Format:

The first and the only line of input contains an integer 'N' representing the size of the chessboard and the number of queens.

Output Format:

 Each line would be representing a single configuration.
 Each configuration would contain N*N elements printed row-wise separated by spaces. The position where we can place the queen will have the value 1 rest will have the value 0.

Note:

You do not need to print anything, it has already been taken care of. Just implement the given function.

Constraints:

1 <= N <= 10

Sample Input 1:

4

Sample Output 1:

0 0 1 0 1 0 0 0 0 0 0 1 0 1 0 0
0 1 0 0 0 0 0 1 1 0 0 0 0 0 1 0 

Explanation of the Sample Input 1:

Output depicts two possible configurations of the chessboard for 4 queens.
The Chessboard matrix for the first configuration looks as follows:-
0 0 1 0
1 0 0 0
0 0 0 1
0 1 0 0
Queen contained cell is depicted by 1. As seen, No queen is in the same row, column or diagonal of the
other queens. Hence this is a valid configuration.

Sample Input 2:

3

Sample Output2:

Explanation of The Sample Input 2:

Since no possible configuration exists for 3 Queen's.The Output remains Empty.