#include <bits/stdc++.h>
using namespace std;

typedef long long ll;

#define sc1(a) scanf("%lld",&a)
#define sc2(a,b) scanf("%lld %lld",&a,&b)

#define pf1(a) printf("%lld\n",a)
#define pf2(a,b) printf("%lld %lld\n",a,b)

#define mx 100005
#define mod 10000007
#define Accepted 0

int main()
{
    int n;
    scanf("%d", &n);

    int a[n][n], x = 0;

    for(int i = 0; i<2*n-1; ++i)
    {
        for(int r = 0; r<=i && r<n; ++r)
        {
            int c = i-r;
            if(c>=0 && c<n)
                a[r][c] = ++x;
        }
    }


    for (int i = 0; i < n; ++i)
    {
        for (int j = n-1; j >= 0; --j)
        {
            printf("%d ", a[i][j]);
        }

        printf("\n");
    }

    return Accepted;
}