UVA524PrimeRingProblem

//UVA524PrimeRingProblem
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<algorithm>
using namespace std;
int n;
int isp[40];
char vis[40];
bool is_prime(int a) {
	bool ok = true;
	for(int i = 2; i <= sqrt(a); i++) {
		if(a % i == 0) {
			ok = false;  break;
		}
	}
	return ok;
}
void dfs(int *a, int cur) {
	if(cur == n && isp[a[n - 1] + a[0]]) {
		printf("%d", 1);
		for(int i = 1; i < n; i++) printf(" %d", a[i]);
		printf("\n");
	}
	else {
		for(int i = 2; i <= n; i++) {
			if(!vis[i] && isp[i + a[cur - 1]]) {
				a[cur] = i;
				vis[i] = 1;
				dfs(a, cur + 1);
				vis[i] = 0;
			}
		}
	}
}


int main() {
	memset(isp, 0, sizeof(isp));
	for(int i = 0; i < 40; i++)  isp[i] = is_prime(i);
	int a[20];
	a[0] = 1;
	int kase = 0;
	while(scanf("%d", &n) == 1) {
		if(kase) printf("\n");
		printf("Case %d:\n", ++kase);
		dfs(a, 1);
	}
	return 0;
}