A - Automated Checking Machine

Time limit: 3 s
Memory limit: 256 MiB
Languages: C, C++, Java, Pascal, ... (details)

The Internet Computer Parts Company (ICPC) is an on-line shop that sells computer parts. Pairs of in-line electrical connectors are among the most popular parts that ICPC sells. However, they are also one of the parts that are returned more often by unsatisfied customers, because due to errors in packaging the connectors sent to the costumers may not be compatible.

An in-line connector is composed of five connection points, labelled from $1$ to $5$. Each connection point of a connector can be either a plug or an outlet. We say two connectors are compatible if, for every label, one connection point is a plug and the other connection point is an outlet (in other words, two connectors are compatible if, for every connection point with the same label, a plug and an outlet meet when the two connectors are connected).

The figure below shows examples of two connectors that are compatible and two connectors that are not compatible.

ICPC is introducing a state-of-the-art Automated Checking Machine (ACM), with an optical checker, which will verify whether the two connectors packaged for a customer are indeed compatible. The complex and expensive hardware of the ACM is ready, but they need your help to finish the software.

Given the descriptions of a pair of in-line connectors, your task is to determine if the connectors are compatible.


The first line contains five integers $X_i$ ($0 \leq X_i \leq 1$ for $i = 1, 2, ..., 5$), representing the connection points of the first connector in the pair. The second line contains five integers $Y_i$ ($0 \leq Y_i \leq 1$ for $i = 1, 2, ..., 5$), representing the connection points of the second connector. In the input, a $0$ represents an outlet an a $1$ represents a plug.


Output a line with a character representing whether the connectors are compatible or not. If they are compatible write the uppercase letter $\texttt{Y}$; otherwise write the uppercase letter $\texttt{N}$.

Sample test(s)

1 1 0 1 0 0 0 1 0 1
1 0 0 1 0 1 0 1 1 0