#include <iostream>
#include <cstdio>
#include <cmath>
#include <vector>
#include <map>
#include <stack>
#include <queue>
#include <algorithm>
#include <set>

#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define REP(i,j) FOR(i,0,j)
#define mp std::make_pair

const int INF = 1 << 24;
const int dx[8] = {0, 0, 1, -1, 1, 1, -1, -1}, dy[8] = {1, -1, 0, 0, 1, -1, 1, -1};

typedef unsigned long long ull;
typedef std::pair<int,int> P;

int image[10][10];

int main(){
    int case_n = 0;

    int N;
    while(std::cin >> N, N){
        printf("Case %d:\n", ++case_n);

        int counter = 0;
        REP(i, 2*N){
            int x, y;
            if(i % 2 == 0){
                x = 0; y = i;
                while(y >= 0){
                    if(x < N && y < N){
                        image[y][x] = ++counter;
                    }
                    x++; y--;
                }
            }else{
                x = i; y = 0;
                while(x >= 0){
                    if(x < N && y < N){
                        image[y][x] = ++counter;
                    }
                    x--; y++;
                }
            }
        }

        REP(i, N){
            REP(j, N){
                printf("%3d", image[i][j]);
            }
            puts("");
        }
    }
}