Name: Classic N
Input: std input
Output: checkmate.txt

Problem Statement
-----------------------------------------------------------------------------
	In this problem you will solve the Classic N by N queens problem. 
Take N queens and attempt to place them on a chessboard that is N by N squares
so that no queen threatens another queen on the board. The Queen in chess can 
move in a straight line in any of the 8 directions around the occupied square.

			
				\ | /
		 		- Q -
				/ | \

Input
-----------------------------------------------------------------------------
	Input will be read from the keyboard and be an integer between 1 and 15.

Output
-----------------------------------------------------------------------------
	Output will consist of a list of results. The first result is the 
number of solutions for the given input size. The second is the number of 
unique results. A unique solution is only counted 1 time and other results 
that are that solution turned 90°, 180°, or 270° are not counted. Note that
the output is titled with the board size. The second line is 30 minus signs.
The phrases "Total Solutions:" and "Unique Solutions:" are right justified.
The result numbers are left justified after a tab character. 


Example Input 1
4


Example Output 1

4 x 4 Chessboard
------------------------------
 Total Solutions:	2
Unique Solutions:	2



Example Input 2
8


Example Output 2

8 x 8 Chessboard
------------------------------
 Total Solutions:	92
Unique Solutions:	?

(Please Note: the number of unique solutions for an 8x8 board is unknown by 
the Author at this time. The reason for Example Output 2 is to show formatting
patterns of the output. The ? is left justified.)


Task for Freshmen:	Just set up the board and move the queens around. 
Task for Sophmores:	Do not worry about unique solutions just get the total number
Task for Juniors:	Do the problem as stated. 
Task for Seniors:	Add another result that removes Mirrored (flip solution across 
			vertical and horizonal planes) solutions. The result for 
			non-mirrored 4 x 4 chessboards is 1. 

Time Challenge::	Try to solve the problem in under 90 minutes.