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;
template <class T>
T abs(T x) {
  return x > 0 ? x : (-x);
}
template <class T>
T sqr(T x) {
  return x * x;
}
long long x3982098543, y3982098543, x2, y2, x3, y3;
bool check(long long X, long long Y) {
  long long d = sqr(x3) + sqr(y3);
  long long dx = X * x3 + Y * y3;
  long long dy = x3 * Y - y3 * X;
  if (d == 0) {
    if (dx == 0 && dy == 0 && X == 0 && Y == 0)
      return true;
    else
      return false;
  } else {
    if (dx % d == 0 && dy % d == 0)
      return true;
    else
      return false;
  }
}
int main() {
  cin >> x3982098543 >> y3982098543 >> x2 >> y2 >> x3 >> y3;
  for (int it = 0; it < 8; ++it) {
    long long X = x2 - x3982098543, Y = y2 - y3982098543;
    if (check(X, Y)) {
      printf("YES\n");
      return 0;
    }
    long long x = y3982098543, y = -x3982098543;
    x3982098543 = x, y3982098543 = y;
  }
  printf("NO\n");
  return 0;
}
