We have two figures $S$ and $T$ on a two-dimensional grid with square cells.
$S$ lies within a grid with $N$ rows and $N$ columns, and consists of the cells where $S_{i,j}$ is `#`.
$T$ lies within the same grid with $N$ rows and $N$ columns, and consists of the cells where $T_{i,j}$ is `#`.
Determine whether it is possible to exactly match $S$ and $T$ by $90$\-degree rotations and translations.
## Constraints
* $1 \leq N \leq 200$
* Each of $S$ and $T$ consists of `#` and `.`.
* Each of $S$ and $T$ contains at least one `#`.
## Input
Input is given from Standard Input in the following format:
$N$
$S_{1,1}S_{1,2}\ldots S_{1,N}$
$\vdots$
$S_{N,1}S_{N,2}\ldots S_{N,N}$
$T_{1,1}T_{1,2}\ldots T_{1,N}$
$\vdots$
$T_{N,1}T_{N,2}\ldots T_{N,N}$
[samples]