Problm C - Prime Ring
---------------------

A prime ring is a circular sequence of all numbers between 1 and n
(where n is an even number) where each pair of consecutive numbers add
up to a prime. This means that the first and the last number of the
sequence must also add up to a prime. Each number between 1 and n
appears exactly once in the sequence. For this problem we only consider
sequences that start with the number 1.

Input
-----
Each line of input will contain a value for n (0<n<=16). The last line
of input will contain the number 0. This line should not be processed.

Output
------

The output of your program should list all prime rimg sequences starting
with 1 for the current value of n in ascending order. The output should
be formatted as in the sample below.

Sample Input
------------

6
8
0

Output for Sample Input
-----------------------

Case 1:
1 4 3 2 5 6
1 6 5 2 3 4

Case 2:
1 2 3 8 5 6 7 4
1 2 5 8 3 4 7 6
1 4 7 6 5 8 3 2
1 6 7 4 3 8 5 2