In the N* N chessboard (1 < = N < = 10) filled 1,2, ... N* N total number of N* N so that any two adjacent numbers and prime numbers. Output to meet the minimum conditions of the program sequence. The smallest sequence of each line will soon connect the composition of his party, and then in front of as small as possible so that, when the first phase at the same time the number is more of a following, and so on. For example, when N = 2, the sequence 1 2 4 3, when no program to meet the conditions of output " NO" .

chess.cpp

• We are an exchange download platform that only provides communication channels. The downloaded content comes from the internet. Except for download issues, please Google on your own.
• The downloaded content is provided for members to upload. If it unintentionally infringes on your copyright, please contact us.
• Please use Winrar for decompression tools
• If download fail, Try it againg or Feedback to us.
• If downloaded content did not match the introduction, Feedback to us，Confirm and will be refund.
• Before downloading, you can inquire through the uploaded person information

Nothing．