CF39D.Cubical Planet

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.

我们的银河系中可以找到任何东西！一颗立方体形状的行星围绕着一颗正二十面体形状的恒星运行。我们建立一个坐标系，使得该立方体行星的各条棱均与坐标轴平行，且两个相对的顶点分别位于点 $(0,\,0,\,0)$ 和 $(1,\,1,\,1)$ 处。两只苍蝇生活在该行星上，此时它们分别停在立方体行星的两个不同的顶点上。你的任务是判断这两只苍蝇是否能彼此看见。当且仅当它们所处的顶点位于立方体的同一面上时，这两只苍蝇才能彼此看见。

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.

第一行包含三个用空格分隔的整数（0 或 1）——第一个苍蝇的坐标；第二行类似地包含第二个苍蝇的坐标。

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

如果两只苍蝇能看到彼此，则输出 "YES"（不带引号）；否则输出 "NO"。