Score: $150$ points

问题陈述

给定两个网格，每个网格都有 $N$ 行和 $N$ 列，分别称为网格 $A$ 和网格 $B$。 网格中的每个单元格都包含一个小写英文字母。 网格 $A$ 中第 $i$ 行第 $j$ 列的字符是 $A_{i, j}$。 网格 $B$ 中第 $i$ 行第 $j$ 列的字符是 $B_{i, j}$。

这两个网格在一个单元格上不同。也就是说，存在唯一的一对正整数 $(i, j)$，且这对整数不超过 $N$，使得 $A_{i, j} \neq B_{i, j}$。找到这个 $(i, j)$。

以上为大语言模型 kimi 翻译，仅供参考。

Problem Statement

You are given two grids, each with $N$ rows and $N$ columns, referred to as grid $A$ and grid $B$.
Each cell in the grids contains a lowercase English letter.
The character at the $i$-th row and $j$-th column of grid $A$ is $A_{i, j}$.
The character at the $i$-th row and $j$-th column of grid $B$ is $B_{i, j}$.

The two grids differ in exactly one cell. That is, there exists exactly one pair $(i, j)$ of positive integers not greater than $N$ such that $A_{i, j} \neq B_{i, j}$. Find this $(i, j)$.

Constraints

• $1 \leq N \leq 100$
• $A_{i, j}$ and $B_{i, j}$ are all lowercase English letters.
• There exists exactly one pair $(i, j)$ such that $A_{i, j} \neq B_{i, j}$.

Input

The input is given from Standard Input in the following format:

$N$

$A_{1,1}A_{1,2}\dots A_{1,N}$

$A_{2,1}A_{2,2}\dots A_{2,N}$

$\vdots$

$A_{N,1}A_{N,2}\dots A_{N,N}$

$B_{1,1}B_{1,2}\dots B_{1,N}$

$B_{2,1}B_{2,2}\dots B_{2,N}$

$\vdots$

$B_{N,1}B_{N,2}\dots B_{N,N}$

Output

Let $(i, j)$ be the pair of positive integers not greater than $N$ such that $A_{i, j} \neq B_{i, j}$. Print $(i, j)$ in the following format:

$i$ $j$

Sample Input 1

3
abc
def
ghi
abc
bef
ghi

Sample Output 1

2 1

From $A_{2, 1} =$ d and $B_{2, 1} =$ b, we have $A_{2, 1} \neq B_{2, 1}$, so $(i, j) = (2, 1)$ satisfies the condition in the problem statement.

Sample Input 2

1
f
q

Sample Output 2

1 1

Sample Input 3

10
eixfumagit
vtophbepfe
pxbfgsqcug
ugpugtsxzq
bvfhxyehfk
uqyfwtmglr
jaitenfqiq
acwvufpfvv
jhaddglpva
aacxsyqvoj
eixfumagit
vtophbepfe
pxbfgsqcug
ugpugtsxzq
bvfhxyehok
uqyfwtmglr
jaitenfqiq
acwvufpfvv
jhaddglpva
aacxsyqvoj

Sample Output 3

5 9