Overwatch World Cup

You went to the Overwatch World Cup with your friends. The best Overwatch players from every country gathered there to decide who is the strongest.

The matches are fun, and cheering from the stands is just as fun. The stands at this tournament have an unusual shape: they form a square, and each side seats exactly as many people as there are teams in the tournament. Every spectator wears the shirt of the team they support.

The stands have one more rule. Each row and each column must seat exactly one fan of every team. Everyone looked like they had followed the rule, but one spectator came wearing the wrong shirt. Given the seating chart and the shirt each spectator wears, find the seat of that spectator and the team shirt they should have worn.

The input holds several test cases and continues to the end of the file.

The first line of each test case has the number of teams in the tournament, $N$ ($3 \le N \le 26$). The next $N$ lines give the seating from the top row down. Each line is a string of length $N$, and its $j$-th character is the team shirt worn by the spectator in the $j$-th seat of that row. A team is written as an uppercase letter from A to Z.

Exactly one spectator in each test case wears the wrong shirt. That shirt may belong to a team that is not in the tournament.

For each test case, print $R$, $C$ and $V$ on one line, separated by single spaces.

$R$ is the row number and $C$ is the column number of the seat where the spectator with the wrong shirt sits, counting rows and columns from 1. $V$ is the team whose shirt that spectator should have worn.