跳到主要内容
图灵 OJTURING / ONLINE JUDGE

#F2133. Cubical Planet

    ID: 2139 传统题 2000ms 256MiB 尝试: 0 已通过: 0 难度: 2 上传者: 标签>数学基础难度共享题库Codeforces英文题面题目来源题面语言

Cubical Planet

题目描述

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

题目来源:fps-www.educg.net-codeforce-1-2833.xml.zip;FPS 共享题包,题包内第 1733 题。保留原作者与原赛事署名。