Prime Ring Problem

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. 

 

Inputn (0 < n < 20). 
OutputThe 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. 
Sample Input

6
8

Sample Output

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

#include<bits/stdc++.h>
using namespace std;
#include<math.h>
int ar[30],book[30],n;
int sushu(int n)
{
    if(n==1)  return(-1);
    if(n==2||n==3||n==5||n==7)
    {
        return(1);
    }
    if(n%2==0||n%3==0||n%5==0||n%7==0)
    {
        return(-1);
    }
    int i,s;
    s=0;
    for(i=7;i<=sqrt(n);i++)
    {
        if(n%i==0)
        {
            s=1;
            break;
        }
    }
    if(s==0)
    {
        return(1);
    }
    else return(-1);

}
void dfs(int step)
{
    int i;
    if((step==n+1)&&(sushu(ar[n]+ar[1])==1))
    {
        for(i=1;i<=n-1;i++)
        {
            printf("%d ",ar[i]);
        }
        printf("%d\n",ar[i]);
    }
    for(i=2;i<=n;i++)
    {
        ar[step]=i;
        if(book[i]==0&&(sushu(ar[step]+ar[step-1])==1))
        {
            book[i]=1;
            dfs(step+1);
            book[i]=0;
        }
    }
    return ;
}
int main()
{
    int d;
    d=1;
    while(scanf("%d",&n)!=EOF)
    {
        ar[1]=1;
        memset(book,0,sizeof(book));
        printf("Case %d:\n",d++);
        dfs(2);
        printf("\n");
    }
    return 0;
}