//新生训练
#include <iostream>
#include <algorithm>
using namespace std;
int a[40], c[21];
int n;
int hwh;
int sum = 0;
void prime(int num)
{
for (int i = 2; i <= num; i++)
{
for (int j = i + i; j <= num; j += i)
{
a[j] = 1;
}
}
}
int bin(int i)
{
for (int j = 1; j < i; j++)
{
if (c[j] == c[i])
{
return 0;
}
}
return 1;
}
void huisu(int row)
{
c[0] = 1;
if (row == n && a[1 + c[n - 1]] == 0)
{
hwh++;
for (int i = 0; i < n; i++)
{
if (i == 0)
{
cout << c[0];
}
else
{
cout << ' ' << c[i];
}
}
cout << "\n";
}
for (int i = 2; i <= n; i++)
{
c[row] = i;
int temp = c[row] + c[row - 1];
if (a[temp] == 0 && bin(row))
{
huisu(row + 1);
}
}
}
int main()
{
while (cin >> n)
{
sum++;
cout << "Case" << sum << ":"
<< "\n";
if (n > 1 && n % 2 != 0)
{
}
else
{
hwh = 0;
memset(a, 0, sizeof(a));
memset(c, 0, sizeof(c));
prime(n * 2);
huisu(1);
}
cout << "\n";
}
return 0;
}
//笔者初见此题的时候较为抽象,但是多练练同类型的题就会好很多;
~~~//仅当笔者个人备忘录使用。