#include<bits/stdc++.h>
using namespace std;
int n,a[50],cnt=0;
bool ok[50]={0,0,1,1,0,1,0,1,0,0,0,1,0,1,0,0,0,1,0,1,0,0,0,1,0,0,0,0,0,1,0,1,0,0,0,0,0,0,1,0,0};
bool v[50]={0};
int dfs(int p)
{
    if(p==n+1)
    {
        if(ok[a[p-1]+a[1]]==0)return 0;
        
        for(int i=1;i<=n;i++)
        {
            cout<<a[i]<<' ';
        }
        cout<<endl;
    }
    for(int i=1;i<=n;i++)
    {
//        cout<<a[p-1]+i<<' '<<ok[a[p-1]+i]<<endl;
        if(v[i]==0&&ok[a[p-1]+i]==1)
        {
            
            v[i]=1;
            a[p]=i;
            dfs(p+1);
            v[i]=0;
        }
    }
}
int main(){
    freopen("primering.in","r",stdin);
    freopen("primering.out","w",stdout);
    while(cin>>n)
    {
        cnt++;
        if(n==1)
        {
            cout<<"Case "<<cnt<<":"<<endl;
            continue;
        }
        else
        cout<<"Case "<<cnt<<":";
        memset(v,0,sizeof(v));
        memset(a,0,sizeof(a));
        a[1]=1;
        v[1]=1;
        dfs(2);
    }
    return 0;
}