翻译（18）

题目：Prime Ring Problem | JXNUOJ

描述：

A ring is compose of n circles as shown in diagram. Put natural number 1, 2, ..., n into each circle separately, and the sum of numbers in two adjacent circles should be a prime.

Note: the number of first circle should always be 1.

如图一个环由n个圆圈组成。将自然数1, 2, ..., n单独放入各自的圆圈，并且相邻的两个圆圈的和应该为质数。

注意：第一个圆圈的数字总是是1.

输入：

n (0 < n < 20).

输出：

The output format is shown as sample below. Each row represents a series of circle numbers in the ring beginning from 1 clockwisely and anticlockwisely. The order of numbers must satisfy the above requirements. Print solutions in lexicographical order.

You are to write a program that completes above process.

Print a blank line after each case.

输出格式如下面的样例所示。每行表示在环中从1开始顺时针和逆时针方向一连串圆圈的数字。数字的顺序必须满足以上要求。按字典顺序打印解决办法。

你将编写一个程序以实现上述功能。

每完成一组输出一行空格。

词汇：

adjacent 相邻的 prime 质数 format 样例 clockwise 顺时针 anticlockwise 逆时针 order 顺序 lexicographical 字典编撰的