#include <stdio.h>
#include <iostream.h>

// Problem 524

int n;

bool prime(int x) {
  return (x==31 || x==29 || x==23 || x==19 || x==17 || x==13 || 
	  x==11 || x==7 || x==5 || x == 3);
}

void print(int prefix[17], int l) {
  // print all combinations that start with the first l numbers in prefix
  // used just says which numbers are used in that prefix
  if (l==n) {
    if (prime(prefix[1] + prefix[n])){
      for (int i=1; i<n; i++)
	cout << prefix[i] << " ";
      cout << prefix[n] << "\n";
    }
  } else {
    bool used[17] = {0};
    int copy[17];
    for (int i=1; i<=l; i++) {
      used[prefix[i]]=1;
      copy[i]=prefix[i];
    }
    for (int i=1; i<=n; i++)
      if (!used[i] && (l==0 || prime(i+copy[l]))) {
	copy[l+1]=i;
	print(copy, l+1);
      }
  }
}

int main() {
  int instance = 1;
  cin >> n;
  while (n) {
    if (instance > 1) cout << "\n";
    cout << "Case " << instance++ << ":\n";
    int prefix[17];
    prefix[1]=1;
    print(prefix, 1);
    cin >> n;
  }
}