#include <vector>
#include <list>
#include <map>
#include <set>
#include <stack>
#include <queue>
#include <deque>
#include <algorithm>
#include <utility>
#include <functional>
#include <sstream>
#include <iostream>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <string>
#include <cstring>
#include <ctime>
#include <climits>
#include <cassert>
using namespace std;
inline int toInt(string s) {int v; istringstream sin(s);sin>>v;return v;}
template<class T> inline string toString(T x) {ostringstream sout;sout<<x;return sout.str();}
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<string> vs;
typedef pair<int, int> pii;
typedef long long ll;
#define ALL(a) (a).begin(),(a).end()
#define RALL(a) (a).rbegin(),(a).rend()
#define EXIST(s,e) ((s).find(e)!=(s).end())
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
#define EACH(t,i,c) for(t::iterator i=(c).begin(); i!=(c).end(); ++i)
const double EPS = 1e-10;
const double PI  = acos(-1.0);

int dx[]={1,-1},dy[]={-1,1};
int shiftdx[]={1,0},shiftdy[]={0,1};
int main() {
	int n;
	int cs=1;
	while(cin>>n,n){
		vvi m(n,vi(n));
		int x=0,y=0;
		int d=0;
		m[0][0]=1;
		int cnt=2;
		while(x!=n-1||y!=n-1){
			int xx=x+dx[d],yy=y+dy[d];
			if(xx<0||yy<0||xx>=n||yy>=n){
				int nx=x+shiftdx[d];
				int ny=y+shiftdy[d];
				if(nx>=n||ny>=n){
					x+=shiftdy[d];
					y+=shiftdx[d];
				}else{
					x=nx;
					y=ny;
				}
				
				d=(d+1)%2;
			}else{
				x=xx;
				y=yy;
			}
			m[x][y]=cnt;
			cnt++;
		}
		cout<<"Case "<<cs<<":"<<endl;
		REP(i,n){
			REP(j,n){
				printf("%3d",m[j][i]);
			}
			cout<<endl;
		}
		cs++;
	}
}