Problem Statement

We have a grid with $2$ horizontal rows and $2$ vertical columns.
Each of the squares is black or white, and there are at least $2$ black squares.
The colors of the squares are given to you as strings S_1S1 and S_2S2, as follows.

• If the $j$-th character of S_iSi is #, the square at the $i$-th row from the top and $j$-th column from the left is black.
• If the $j$-th character of S_iSi is ., the square at the $i$-th row from the top and $j$-th column from the left is white.

You can travel between two different black squares if and only if they share a side.
Determine whether it is possible to travel from every black square to every black square (directly or indirectly) by only passing black squares.

Constraints

• Each of S_1S1 and S_2S2 is a string with two characters consisting of # and ..
• S_1S1 and S_2S2 have two or more #s in total.

S_1S1S_2S2