#include <bits/stdc++.h>
using namespace std;
int s [6][6];
bool f;

bool fd (int i, int j)
{	int ma = INT_MIN;
	for (int k = 1; k <= 5; k++)
	{	if (s [i][k] > ma)
			ma = s [i][k];
	}
	if (s[i][j] == ma)
		return 1;
	else
		return 0;
}

bool fx (int i, int j)
{	int mi = INT_MAX;
	for (int k = 1; k <= 5; k++)
	{	if (s [k][j] < mi)
			mi = s [k][j];
	}
	if (s[i][j] == mi)
		return 1;
	else
		return 0;
}

int main()
{	for (int i = 1; i <= 5; i++)
	{	for (int j = 1; j <= 5; j++)
			cin >> s [i][j];
	}
	for (int i = 1; i <= 5; i++)
	{	for (int j = 1; j <= 5; j++)
			if (fd (i, j) == 1 && fx (i, j) == 1)
			{	cout << i << ' ' << j << ' ' << s [i][j] <<
				     endl;
				f = 1;
			}
	}
	if (f == 0)
		cout << "No found";
	return 0;
}