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 point {
  long long x, y;
  point(long long a = 0, long long b = 0) : x(a), y(b) {}
  long long operator*(point B) { return x * B.x + y * B.y; }
  point rota() { return point(-y, x); }
  point operator-(point B) { return point(x - B.x, y - B.y); }
  void read() { cin >> x >> y; }
};
point A, B, C;
string solve() {
  point Ct = C.rota();
  long long tam = C * C;
  for (int i = 0; i < 4; i++) {
    point D = B - A;
    if (C.x == 0 && C.y == 0) {
      if (D.x == 0 && D.y == 0) return "YES";
    } else if (D * C % tam == 0 && D * Ct % tam == 0)
      return "YES";
    A = A.rota();
  }
  return "NO";
}
int main() {
  A.read();
  B.read();
  C.read();
  cout << solve() << endl;
}
