#include<stdio.h>
int main()
{
int n,i,j,k,l;
scanf_s("%d", &n);
int a[100][100]={0};
int max = a[0][0];
int min;
int ret = 0;
for (i = 0; i < n; i++)
{
for (j = 0; j < n; j++)
{
scanf_s("%d", &a[i][j]);
}
}
for (i = 0; i < n; i++)//行数
{
for (k = 1; k <= n; k++)//判断每一行的最大值
{
max = a[i][0];
if (a[i][0] < a[i][k])
max = a[i][k];
}
for (j = 0;j<n;j++)//判断每一列的最小值
{
for (l = 1; l < n; l++)
{
min = a[0][j];
if (a[l][j] < min)
min = a[l][j];
if (min = max)
{
printf("%d %d",l,j);
ret = 1;
printf("%d", ret);
}
}
}
}
if (ret = 0)
printf("没有鞍点");
return 0;
}