Treasure Hunt

Bill船长收到一个有趣的挑战，有一些陌生人给了他一张地图和一些能够远程传送的药水………… 简单而言，给你移动方式，让你判断能否从(x1,y1)的位置移动到(x2,y2)的位置 而移动方式如下：输入x,y，你一共有四种移动方式可选择     输入格式 第一行输入x1,y1,x2,y2第二行输入x,y 输出格式 如果可以，输出YES，如果不行，输出NO

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.

The first line contains four integer numbers $ x_{1},y_{1},x_{2},y_{2} $ ( $ -10^{5}<=x_{1},y_{1},x_{2},y_{2}<=10^{5} $ ) — positions of Captain Bill the Hummingbird and treasure respectively. The second line contains two integer numbers $ x,y $ ( $ 1<=x,y<=10^{5} $ ) — values on the potion bottle.

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

0 0 0 6
2 3

YES

1 1 3 6
1 5

NO

In the first example there exists such sequence of moves: 1.  — the first type of move 2.  — the third type of move