You are trying to solve the famous N queens problem. You broke one of the queens from your chess pieces collections. Now, you have created the following puzzle:
You are given an N*N chessboard. Is it possible to place N-1 queens on it in such a way that no pair of queens is attacking each other?
Two queens are attacking each other if at least one of the following conditions is true:
They share the same row They share the same column They share the same diagonal You are given a single integer N. Print any possible configuration in the format below. It is guaranteed that there is always an answer
for example N=4. one of the possible answer is
* . . . . . * . . . . . . * . .