#include <stdio.h>

int main()
{
	int n, a[101][101],max,j,k;

	for (int i = 1; i <= n; i++)
	{
		for (int j = 1; j <= n; j++){
			scanf("%d", &a[i][j]);
		}
	}
	for (int i = 1; i <= n; i++)
	{
		max = -200000000;
		for ( j = 1; j <= n; j++)
		{
			for ( k = 1; k <= n; k++)
			{
				if (a[j][k] > max && (j!=k||j>i))
				{
					max = a[j][k];
				}
			}
		}
		int t = a[j][k];
		a[j][k] = a[i][i];
		a[i][i] = a[j][k];
	}

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

		}
		printf("\n");
	}

	return 0;
}