No tag edit access

D. Cubical Planet

time limit per test

2 secondsmemory limit per test

64 megabytesinput

standard inputoutput

standard outputYou 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

0 0 0

0 1 0

Output

YES

Input

1 1 0

0 1 0

Output

YES

Input

0 0 0

1 1 1

Output

NO

Codeforces (c) Copyright 2010-2017 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Dec/14/2017 16:16:32 (c6).

Desktop version, switch to mobile version.

User lists

Name |
---|