#include <iostream>
#include <cmath>
using namespace std;
int a[20];
int n, cur;
bool prime( int n)
{
int i, t, flag;
flag = 1;
t = (int) sqrt(n*1.0);
for(i = 2; i <= t; i++)
{
if(n%i == 0)
{
flag = 0;
break;
}
}
if(flag)
{
return true;
}
return false;
}
void show( int cur )
{
int i, j, coun;
if( n == cur && prime( a[0] + a[n-1]))
{
for(i = 0; i < n; i++)
{
cout << a[i];
if(i != n-1)
{
cout << " ";
}
}
cout << endl;
}
else
{
for(i = 2; i <= n; i++)
{
bool flag = true;
for(j = 1; j < n; j++ )
{
if(a[j] == i)
{
flag = false;
}
}
if(flag)
{
a[cur] = i;
if(prime ( a[cur] + a[cur - 1])) //*********************
{
show(cur + 1);
}
a[cur] = 0;
}
}
}
}
int main()
{
int i, j;
j = 0;
while(cin >> n)
{
j++;
if( n == 1)
{
cout << "Case " << j << ":" << endl;
cout << endl;
continue;
}
for(i = 0; i < n; i++)
{
a[i] = 0;
}
a[0] = 1;
cout << "Case " << j << ":" << endl;
show(1);
cout << endl;
}
return 0;
}