import java.util.Scanner;

public class C {
    
    static int n;
    static int len;
    static int[] seq;
    
    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        n = in.nextInt();
        seq = new int[17];
        int c=0;
        while (n>0)
        {
            c++;
            System.out.println("Case " + c + ":");
            len=1;
            seq[1]=1;
            printSeq();
            n = in.nextInt();
            if (n>0) System.out.println();
        }
    }

    static void printSeq()
    {
        int lastDigit = seq[len];
        if (len == n)
        {
            if (isPrime(lastDigit + 1))
            {
                for (int i=1;i<=n-1;i++)
                {
                    System.out.print(seq[i] + " ");
                }
                System.out.println(seq[n]);
            }
        }
        else
        {
        for (int i=2;i<=n;i++)
        {
            if (isPrime(lastDigit + i) && (notInSeq(i)))
            {
                seq[len+1]=i;
                len++;
                printSeq();
                len--;
            }
        }
        }
    }
    
    
    static boolean isPrime(int num)
    {
        boolean result = true;
        for (int i=2;i<=num/2;i++)
        {
            if ((num % i)==0) result = false;
        }
        return result;
    }
    
    static boolean notInSeq(int num)
    {
        for (int i=1;i<=len;i++)
            if (seq[i] == num) return false;
        return true;
    }
}