Igor returns from Azkaban 2 days later and finds out that Viktor had solved the puzzles quite easily. So he decides to raise the stakes. He takes Viktor to the room with the life sized chessboard. Viktor was a rather famous chess player, so he didn’t mind. Igor was aware of this, so he brings in a new piece, a SuperQueen.It can perform all moves of a queen as well as a knight. Igor gives Viktor 10 SuperQueens and increases the chess board’s dimensions to `10 xx 10`. He then asks for the number of possible ways that all 10 pieces can be placed on the board without coming in each other’s path. What is the answer?

Explanation

This question is a modification of the N-queens problem. For more information regarding N-queens problem visit