#include <cstdio>

 #include <cstring>

 int A[], vis[];

 int n;

 int is_prime(int n)

 {

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

         if(n % i == )   return ;

     return ;

 }

 void dfs(int cur)

 {

     if(cur == n && is_prime(A[]+A[n-]))

     {

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

         {

             printf("%d", A[i]);

             printf("%s", i == n- ? "\n" : " ");

         }

         return;

     }

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

         if(vis[i] ==  && is_prime(i+A[cur-]))

         {

             A[cur] = i;

             vis[i] = ;

             dfs(cur+);

             vis[i] = ;

         }

 }

 int main()

 {

 #ifdef LOCAL

     freopen("in", "r", stdin);

 #endif

     int kase = ;

     while(scanf("%d", &n) != EOF)

     {

         memset(vis, , sizeof(vis));

         A[] = ;

         vis[] = ;

         if (kase)   printf("\n");

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

         dfs();

     }

     return ;

 }