素数环

A ring is composed of n (even number) circles as shown in diagram. Put natural numbers 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.

Input

n (0 < n ≤ 16)
Output

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.

You are to write a program that completes above process.

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 <iostream>
#include  <cstring>
using namespace std;
int a[20],n;
int c=1;
bool b[20];
int pz(int x){
	int i;
	for( i=2;i<=x/2;i++)
	if(x%i==0)return 0;
	if(i>x/2)return 1;
	if(x==1)return 0;
}
void dfs(int step){	
	if(step==n+1&&pz(a[1]+a[step-1])){
		cout<<a[1]<<' ';
		for(int i=2;i<=n;i++)
		{	
			if(i==n)cout<<a[i];
			else cout<<a[i]<<' ';
		}
		cout<<'\n';
	}
	for(int i=2;i<=n;i++){
		if(b[i]==false&&pz(a[step-1]+i)){
			a[step]=i;
			b[i]=true;
			dfs(step+1);
			b[i]=false;
		}
	}	
}
int main(int argc, char *argv[])
{			//freopen("r.txt","r",stdin);
			//freopen("w.txt","w",stdout);
		while(cin>>n){			
		a[1]=1;
		memset(b,sizeof(b),false);
		if(c>1)cout<<'\n';
		cout<<"Case "<<c++<<':'<<'\n';
		dfs(2);	
		
		}
	return 0;
}