PROGRAMMING:Queen n
N queens are placed on the n * n checkerboard, so that they do not attack each other (that is, any two queens are not allowed to be in the same row or column, and they are not allowed to be on the diagonal line with a 45 angle to the border of the checkerboard).
Your task is to find out how many legal placement methods there are for a given n
###Input format:
There are several lines, each line a positive integer n ≤ 10, indicating the number of chessboard and queen;
###Output format:
There are several rows, each of which is a positive integer, indicating the different number of queens placed in the corresponding input row
###Input example:
Here is a set of inputs. For example:
```in
one
eight
five
```
###Output example:
The corresponding output is given here. For example:
```out
one
ninety-two
ten
```
answer：If there is no answer, please comment
Your task is to find out how many legal placement methods there are for a given n
###Input format:
There are several lines, each line a positive integer n ≤ 10, indicating the number of chessboard and queen;
###Output format:
There are several rows, each of which is a positive integer, indicating the different number of queens placed in the corresponding input row
###Input example:
Here is a set of inputs. For example:
```in
one
eight
five
```
###Output example:
The corresponding output is given here. For example:
```out
one
ninety-two
ten
```
answer：If there is no answer, please comment