Prime Ring Problem（https://acs.jxnu.edu.cn/problem/HDU1016）

描述：

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 (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.

翻译：一个由n个圆组成的环如图所示.分别将自然数1.2.3..n分别放入每个圆里.并且每相邻两个圆内的自然数之和为素数.

注意：起始圆内的数字恒为1.

输入：n（0<n<20）.

输出：输出模板如下例所示.

每一行代表着环中一系列圆中数字，在环中从顺时针和逆时针1开始.数字必须满足上述要求.按照词典顺序打印方案.

你需要编写一个能完成上述过程的程序.

在每一个样例之后打印一个空行.