Answer to Question #40009 in C++ for christine

Question

how to write a program that puts the integer from 1 to N into each circle separately, in such a way that the sum of the numbers in any two adjacent circle is a prime number??

input:
the input to the program is a positive, non-zero even integer N. Assume that 0<N<=20.

Output:
the out put of the program must be the sequence of numbers in a ring, starting from circle marked with the value 1, and proceeding in a clockwise direction.

>>>
sample input and output:

if the value for N is 6
the produce sequence can be: 1 4 3 2 5 6

if the value for N is 8
the produced sequence is: 1 2 3 8 5 6 7 4