using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
using System.Threading.Tasks;

public delegate void nextLoop(int[,] nigger, int lastNum, int finalNum, int corridorCount, bool direction, int lastLoop1, int lastLoop2);

class Program
{
    static void Main(string[] args)
    {
        int n = 0;
        try
        {
            if (!int.TryParse(Console.ReadLine(), out n) || n > 10 || n < 1)
                throw new ArgumentException("are you fucking retarded");
        }
        catch (Exception ex)
        {
            Console.WriteLine(ex.Message);
        }

        int[,] ninja = new int[n, n];
        Methods.NumSnailLoop(ninja, 0, n * n, 1, true, 0, 0);

        for (int i = 0; i < ninja.GetLength(0); i++)
        {
            for (int j = 0; j < ninja.GetLength(0); j++)
                Console.Write(ninja[i, j] + " ");
            Console.WriteLine();
        }
    }
}

static class Methods
{
    static public event nextLoop Reactionary = NumSnailLoop;

    public static void NumSnailLoop(int[,] nigger, int lastNum, int finalNum, int corridorCount, bool direction, int lastLoop1, int lastLoop2)
    {
        if (corridorCount % 2 == 1)
        {
            if (direction)
            {
                for (; lastLoop2 < nigger.GetLength(0) && nigger[lastLoop1, lastLoop2] == 0; lastLoop2++)
                {
                    lastNum += 1;
                    nigger[lastLoop1, lastLoop2] = lastNum;
                }
                lastLoop2--; // lastLoop2 = lastLoop2 - 1;
                lastLoop1++;
            }
            else
            {
                for (; lastLoop2 >= 0 && nigger[lastLoop1, lastLoop2] == 0; lastLoop2--)
                {
                    lastNum += 1;
                    nigger[lastLoop1, lastLoop2] = lastNum;
                }
                lastLoop2++;
                lastLoop1--;
            }
        }
        else
        {
            if (direction)
            {
                for (; (lastLoop1 < nigger.GetLength(0) && nigger[lastLoop1, lastLoop2] == 0); lastLoop1++)
                {
                        lastNum += 1;
                        nigger[lastLoop1, lastLoop2] = lastNum;
                }
                lastLoop1--;
                lastLoop2--;
            }
            else
            {
                for (; (lastLoop1 >= 0 && nigger[lastLoop1, lastLoop2] == 0); lastLoop1--)
                {
                        lastNum += 1;
                        nigger[lastLoop1, lastLoop2] = lastNum;
                }
                lastLoop1++;
                lastLoop2++;
            }
            direction = !direction;
        }
        corridorCount++;
        if(lastNum < finalNum)
            NumSnailLoop(nigger, lastNum, finalNum, corridorCount, direction: direction, lastLoop1: lastLoop1, lastLoop2);
    }
}