#include<cstdio>

 #include<cstring>

 #include<iostream>

 using namespace std;

 int n, ring[], vis[];

 inline bool is_prime(int x){

     for(int i = ; i * i <= x; i++){

         if(x % i == ) return ;

     }

     return ;

 }

 inline void dfs(int x){

     if(x == n && is_prime(ring[x] + ring[])){

         for(int i = ; i < n; i++)

             printf("%d ", ring[i]);//输出格式要严格

         printf("%d\n", ring[n]);

         return;

     }

     for(int i = ; i <= n; i++){

         if(!vis[i] && is_prime(ring[x] + i)){

             vis[i] = ;

             ring[x + ] = i;

             dfs(x + );

             vis[i] = ;

         }

     }

 }

 int main(){

     int k = ;

     while(~scanf("%d", &n)){

         memset(ring, , sizeof(ring));

         memset(vis, , sizeof(vis));

         ring[] = ;

         printf("Case %d:\n", k);

         k++;

         if(n %  ==  && n > ) dfs();

         printf("\n");

     }

     return ;

 }