#include <iostream>
#include <stdio.h>
#include <string.h>
#include <math.h>
#include <stdlib.h>
#include <algorithm>
#include <vector>
#include <limits.h>
#include <queue>
#include <stack>
using namespace std;
int main()
{
    int mp[11][11];
    int n,i,x,y,d,j;
    int cas = 0;
    while(cin>>n&&n)
    {
        x = 1;y = 1;
        i = 1;
        cout<<"Case "<<++cas<<":"<<endl;
        while(1)
        {
            //cout<<x<<" "<<y<<endl;
            if(x >= n&&y >= n){ mp[x][y] = i;break;}
            if(x == 1)
            {
                if(y < n)
                {
                    if(y % 2 == 1)
                    {
                        mp[x][y] = i++;
                        y ++;
                    }
                    else
                    {
                        mp[x][y] = i ++;
                        x ++;y--;d = 1;
                    }
                }
                if(y == n)
                {
                    if(y%2 == 0)
                    {
                        mp[x][y] = i++;
                        x ++;y --;d = 1;
                    }
                    else
                    {
                        mp[x][y] = i++;
                        x ++;
                    }
                }
            }
            else if(y == 1)
            {
                if(x < n)
                {
                    if(x % 2 == 0)
                    {
                        mp[x][y] = i++;
                        x ++;
                    }
                    else
                    {
                        mp[x][y] = i ++;
                        x --;y ++;d =0 ;
                    }
                }
                else
                {
                    if(x % 2 == 0)
                    {
                        mp[x][y] = i++;
                        y ++;
                    }
                    else
                    {
                        mp[x][y] = i ++;
                        x --;y ++;d =0 ;
                    }
                }
            }
            else if(x == n)
            {

                if(y < n)
                {
                    if(x % 2 == 1){
                    if(y % 2 == 0)
                    {
                        mp[x][y] = i++;
                        y ++;
                    }
                    else
                    {
                        mp[x][y] = i ++;
                        x --;y++;d = 0;
                    }
                    }
                    else
                    {
                        if(y % 2 == 1)
                    {
                        mp[x][y] = i++;
                        y ++;
                    }
                    else
                    {
                        mp[x][y] = i ++;
                        x --;y++;d = 0;
                    }
                    }
                }
            }
            else if(y == n)
            {
                if(x < n)
                {
                    if(y % 2 == 0){
                    if(x % 2 == 0)
                    {
                        mp[x][y] = i++;
                        x ++;
                    }
                    else
                    {
                        mp[x][y] = i ++;
                        x ++;y --;d = 1;
                    }
                    }
                    else
                    {
                        if(x % 2 == 1)
                    {
                        mp[x][y] = i++;
                        x ++;
                    }
                    else
                    {
                        mp[x][y] = i ++;
                        x ++;y --;d = 1;
                    }
                    }
                }
            }
            else
            {
                if(d)
                {
                    mp[x][y] = i++;
                    x ++;y --;
                }
                else
                {
                    mp[x][y] = i++;
                    x --;y ++;
                }
            }
        }
        for(i = 1;i <= n;i ++)
        {
            for(j = 1;j <= n;j ++)
            {
                printf("%3d",mp[i][j]);
            }
            cout<<endl;
        }
    }
}

Measured memory_bytes: 0