CF817A.Treasure Hunt

Captain Bill the Hummingbird and his crew recieved an interesting challenge offer. Some stranger gave them a map, potion of teleportation and said that only this potion might help them to reach the treasure.

Bottle with potion has two values x and y written on it. These values define four moves which can be performed using the potion:

• 
• 
• 
• 

Map shows that the position of Captain Bill the Hummingbird is (_x_1, _y_1) and the position of the treasure is (_x_2, _y_2).

You task is to tell Captain Bill the Hummingbird whether he should accept this challenge or decline. If it is possible for Captain to reach the treasure using the potion then output "YES", otherwise "NO" (without quotes).

The potion can be used infinite amount of times.

蜂鸟船长比尔和他的船员收到了一项有趣的挑战邀请。一位陌生人给了他们一张地图、一瓶传送药水，并称只有这瓶药水能帮助他们抵达宝藏。

药水瓶上标有两个数值 $x$ 和 $y$，这两个数值定义了使用该药水可执行的四种移动方式：

• 
• 
• 
• 

地图显示：蜂鸟船长比尔的初始位置为 $(x_1,\,y_1)$，宝藏的位置为 $(x_2,\,y_2)$。

你的任务是告诉蜂鸟船长比尔他是否应接受这项挑战。若船长能借助该药水抵达宝藏，则输出 "YES"，否则输出 "NO"（不带引号）。

药水可无限次使用。

The first line contains four integer numbers _x_1, _y_1, _x_2, _y_2 ( - 105 ≤ _x_1, _y_1, _x_2, _y_2 ≤ 105) — positions of Captain Bill the Hummingbird and treasure respectively.

The second line contains two integer numbers x, y (1 ≤ x, y ≤ 105) — values on the potion bottle.

第一行包含四个整数 $x_1,\ y_1,\ x_2,\ y_2$（$-10^5 \le x_1,\ y_1,\ x_2,\ y_2 \le 10^5$），分别表示蜂鸟船长比尔与宝藏的位置。

第二行包含两个整数 $x,\ y$（$1 \le x,\ y \le 10^5$），表示药水瓶上的数值。

Print "YES" if it is possible for Captain to reach the treasure using the potion, otherwise print "NO" (without quotes).

如果船长能够借助药水到达宝藏，则输出 “YES”，否则输出 “NO”（不带引号）。

In the first example there exists such sequence of moves:

1. — the first type of move
2. — the third type of move

在第一个例子中，存在如下移动序列：

1. — 第一种类型的移动
2. — 第三种类型的移动