#include<iostream>
#include<cstdio>
#include<cstring>
#include<string>
#include<algorithm>
using namespace std;

int N;
bool vis[21];
int pre[21];
bool prime[45];
bool Flag[45];

void GetPrime()
{
    int i, j;
    for(i=2; i<=40; i++)
    {
        if(!Flag[i]) //沒有被標記就是素數
        {
            prime[i] = true; 
            for(j=i*i; j<=40; j=j+i) Flag[j] = true; //標記不是素數的數
        }
    }
}

void DFS(int step){
    int i;
    if(step==N){
        if(prime[pre[step-1]+1]){
            cout<<"1";
            for(i=1; i<N; i++) cout<<" "<<pre[i];
            cout<<endl;
        }
        return;
    }else{
        for(i=2; i<=N; i++){
            if(vis[i]==false && prime[pre[step-1]+i]){
                vis[i] = true;
                pre[step] = i; //記錄路徑
                DFS(step+1);
                vis[i] = false; //回溯就是這么一句話
            }
        }
    }
}
int main()
{
    int CaseN=1;
    GetPrime(); //打出素數表
    while(cin>>N)
    {
        cout<<"Case "<<CaseN++<<":"<<endl;
        vis[1]=true;
        pre[0] = 1;
        DFS(1);
        cout<<endl;
    }
}