P1562 Still N-Queens

As the title says, this is the famous $N$-Queens problem.

The first line contains an integer $N$. Then follow $N$ lines, each with $N$ characters, describing a board; `*` means placeable, `.` means not placeable.

Output the total number of solutions.

$0 < N \le 14$. Translated by ChatGPT 5