#include<stdio.h>
int main()
{
int n, i, j, k, l, a1 = 0, b = 0, c = 0, d = 0, e = 0, f = 0, x = 0, y = 0;
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++)//判断每一行的最大值
{
e = i;
f = k;
max = a[i][0];
if (a[e][0] < a[e][f])
{
a1 = i;
b = k;
max = a[a1][b];
if (k = --n)
{
n += 1;
goto out1;
}
}
}
out1:for (j = 0; j < n; j++)//判断每一列的最小值
{
for (l = 1; l < n; l++)
{
x = l;
y = j;
min = a[0][j];
if (a[x][y] < min)
{
c = l;
d = j;
min = a[c][d];
}
if (a1 == c && b == d)
{
printf("%d %d", c, d);
ret = 1;
printf("%d", ret);
goto out2;
}
}
}
}
if (ret = 0)
printf("没有鞍点");
out2: return 0;
}