#include <iostream>
#include <string>
#include <vector>
#include <map>

using namespace std;

int main()
{
	int n;
	
	while (cin >> n)
	{
		vector<string> lines;
		for (int i = 0; i < n; i++)
		{
			string line;
			cin >> line;
			lines.push_back(line);
		}
		
		vector<int> addedVector;
		map<char, int> charsCountMap;
		vector<char> chars;
		for (int i = 0; i < lines.size(); i++)
		{
			string currentLine = lines[i];
			int added = 0;
			for (int j = 0; j < currentLine.length(); j++)
			{
				map<char, int>::iterator it = charsCountMap.find(currentLine[j]);
				if (it != charsCountMap.end())
				{
					charsCountMap[currentLine[j]]++;
				}
				else
				{
					charsCountMap.insert(pair<char, int>(currentLine[j], 1));
					chars.push_back(currentLine[j]);
					added++;
				}
			}
			
			addedVector.push_back(added);
		}
		
		int max = 0;
		for (int i = 0; i < chars.size(); i++)
		{
			if (charsCountMap[chars[i]] > max)
			{
				max = charsCountMap[chars[i]];
			}
		}
		
		char lessThanMax;
		char exactlyOne;
		for (int i = 0; i < chars.size(); i++)
		{
			if (charsCountMap[chars[i]] == 1)
				exactlyOne = chars[i];
			
			if (charsCountMap[chars[i]] == max - 1)
				lessThanMax = chars[i];
		}
		
		for (int i = 0; i < n; i++)
		{
			for (int j = 0; j < n; j++)
			{
				if (lines[i][j] == exactlyOne)
				{
					cout << i + 1 << " " << j + 1 << " " << lessThanMax << endl;
				}
			}
		}
	}
}