At a geometry lesson Gerald was given a task: to get vector B out of vector A. Besides, the teacher permitted him to perform the following operations with vector А:

  * Turn the vector by 90 degrees clockwise.
  * Add to the vector a certain vector C.



Operations could be performed in any order any number of times.

Can Gerald cope with the task?

Input

The first line contains integers x1 и y1 — the coordinates of the vector A ( - 108 ≤ x1, y1 ≤ 108). The second and the third line contain in the similar manner vectors B and C (their coordinates are integers; their absolute value does not exceed 108).

Output

Print "YES" (without the quotes) if it is possible to get vector B using the given operations. Otherwise print "NO" (without the quotes).

Examples

Input

0 0
1 1
0 1


Output

YES


Input

0 0
1 1
1 1


Output

YES


Input

0 0
1 1
2 2


Output

NO
#include <bits/stdc++.h>
using namespace std;
struct node {
  long long x, y;
} A, B, C;
bool judge(long long x, long long y) {
  struct node D;
  D.x = C.y, D.y = -C.x;
  x = B.x - x, y = B.y - y;
  if (C.x == 0 && C.y == 0) {
    if (x == 0 && y == 0) return 1;
  } else if (C.x == 0 && C.y != 0) {
    if (x % D.x == 0 && y % C.y == 0) return 1;
  } else if (C.x != 0 && C.y == 0) {
    if (x % C.x == 0 && y % D.y == 0) return 1;
  } else {
    long long num2 = D.y * C.x - D.x * C.y;
    long long num1 = y * C.x - x * C.y;
    if (num2 == 0) {
      if (num1 == 0) return 1;
    } else {
      if (num1 % num2 == 0) {
        long long b = num1 / num2;
        long long c = x - b * D.x;
        if (c % C.x == 0) return 1;
      }
    }
  }
  return 0;
}
int main() {
  while (cin >> A.x >> A.y >> B.x >> B.y >> C.x >> C.y) {
    bool flag = false;
    if (judge(A.x, A.y)) flag = true;
    if (judge(A.y, -A.x)) flag = true;
    if (judge(-A.x, -A.y)) flag = true;
    if (judge(-A.y, A.x)) flag = true;
    if (flag == true)
      cout << "YES" << endl;
    else
      cout << "NO" << endl;
  }
  return 0;
}
