## Algorithm

D. Cubical Planet
time limit per test
2 seconds
memory limit per test
64 megabytes
input
standard input
output
standard output

You can find anything whatsoever in our Galaxy! A cubical planet goes round an icosahedral star. Let us introduce a system of axes so that the edges of the cubical planet are parallel to the coordinate axes and two opposite vertices lay in the points (0, 0, 0) and (1, 1, 1). Two flies live on the planet. At the moment they are sitting on two different vertices of the cubical planet. Your task is to determine whether they see each other or not. The flies see each other when the vertices they occupy lie on the same face of the cube.

Input

The first line contains three space-separated integers (0 or 1) — the coordinates of the first fly, the second line analogously contains the coordinates of the second fly.

Output

Output "YES" (without quotes) if the flies see each other. Otherwise, output "NO".

Examples
input
Copy
`0 0 00 1 0`
output
Copy
`YES`
input
Copy
`1 1 00 1 0`
output
Copy
`YES`
input
Copy
`0 0 01 1 1`
output
Copy
`NO`

## Code Examples

### #1 Code Example with C++ Programming

```Code - C++ Programming```

``````#include <cstdio>

int main(){

int x1, y1, z1, x2, y2, z2; scanf("%d %d %d %d %d %d", &x1, &y1, &z1, &x2, &y2, &z2);
puts(((x1 ^ x2) && (y1 ^ y2) && (z1 ^ z2)) ? "NO" : "YES");

return 0;
}``````
Copy The Code &

Input

cmd
0 0 0
0 1 0

Output

cmd
YES