import java.io.*;
import java.util.*;

public class Shootout
{
	public static void main(String[]args) throws Exception
	{
 Scanner keyboard = new Scanner(new File("pr92.dat"));
 int side = keyboard.nextInt();
 int matrix[][] = new int [side][side];
 int maxLength = side;
 int maxWidth = side;
 int direction = 0;
 int max = side^2;
 int current=0;
 
 
 for(int i=((side+1)-maxLength); i<maxLength; i++)
 {
 	
 	for(int j=((side+1)-maxWidth); j<maxWidth; j++)
 	{
  if(direction==0)
  {
  	for(int k = 0; k<side; k++)
  	{
   matrix[i][j] = max-j;
   current = max-k;
  	}
  	
  	direction = 2;
  	maxWidth--;
  }
  
  if(direction==1)
  {
  	for(int k = 0; k<side; k++)
  	{
   matrix[i][j] = current;
   current--;
  	}
  	
  	direction = 2;
  	maxWidth--;
  }
  
  if(direction==2)
  {
  	for(int k = 0; k<side; k++)
  	{
   matrix[j][i]=current;
   current--;
  	}
  }
  
  direction=1;
  maxWidth--;
  
 	//	maxWidth--;
 	}
 	
 	maxLength--;
 }
 
 for(int i = 0; i<side; i++)
 {
 	for(int j=0; j<side; j++)
 	{
  System.out.print(matrix[i][j] + "\t");
 	}
 	
 	System.out.println();
 }
	
	}

}

import java.awt.*;

public final class SpiralGenerator extends Object {
	static final int UP = 0, RIGHT = 1, DOWN = 2, LEFT = 3;
	int count, remain, distance, direction;

	SpiralGenerator() {
 count = 1;
 remain = 2;
 distance = 1;
 direction = RIGHT;
 }

	public void generate(int number, Point point) {
 int dx = 0, dy = 0;

 for (; count <= number; count++) {
 	if (--remain == 0) {
  switch (direction) {
  	case UP: distance++; direction = LEFT; break;
  	case DOWN: distance++;
  	default: direction--; break;
  	}
  remain = distance;
  }
 	switch (direction) {
  case LEFT: --dx; break;
  case RIGHT: ++dx; break;
  case UP: --dy; break;
  case DOWN: ++dy; break;
  }
 	}

 point.translate(dx, dy);
 }
	}

public final class PrimeGenerator extends Object {
	int number, index, primes[], squares[];

	PrimeGenerator() {
 index = 0;
 number = 1;
 primes = new int[1];
 squares = new int[1];
 }

	public int generate() {
 if (number > 2) {
loop:
 	while(true) {
  number += 2;
  for (int i = 1; i < index && number >= squares[i]; i++) {
  	if ((number % primes[i]) == 0) continue loop;
  	}
  break loop;
  }
 	}
 else number++;

 squares[index] = (primes[index] = number) * number;

 if (++index == primes.length) reallocate();

 return number;
 }

	void reallocate() {
 int array[];

 System.arraycopy(primes, 0, (array = new int[primes.length * 2]), 0, primes.length);
 primes = array;

 System.arraycopy(squares, 0, (array = new int[squares.length * 2]), 0, squares.length);
 squares = array;
 }
	}