Introduction - If you have any usage issues, please Google them yourself
On board n* n (1 <= n <= 10) filled with 1,2,3, ...., N* n, a total number of n* n, so that any adjacent, and the number of prime numbers.
Input: n
Output: If there are multiple solutions, we need to output the first row, first column of the permutation scheme and are minimal if no solution, then output no .