Eunki's DNA Molecules

A DNA string uses A, C, G, T. Apply these bidirectional substring replacements:

• A ↔ TC
• C ↔ AG
• G ↔ CT
• T ↔ GA

For $N$ strings, output whether each pair can transform from the first to the second.

Line 1: $N$ ($2 \le N \le 100$). Next $N$ DNA strings (length $\le 50\,000$).

$N$ lines of $N$ 0/1 chars; 1 at $(i,j)$ means string $i$ can become string $j$.