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;
int n, m;
int k;
bool debug = false;
long long xa, xb, xc, ya, yb, yc;
long long X[5], Y[5];
long long d[4][2][2] = {
    {{1, 0}, {0, 1}}, {{-1, 0}, {0, -1}}, {{0, 1}, {-1, 0}}, {{0, -1}, {1, 0}}};
bool dd(long long x2, long long y2) {
  long long dx = xa - x2, dy = ya - y2;
  long long t1 = -(xc * dx + yc * dy) / (xc * xc + yc * yc);
  long long t2;
  if (yc != 0) {
    t2 = -(dx + xc * t1) / yc;
  } else {
    t2 = (dy + yc * t1) / xc;
  }
  return (xa + xc * t1 + yc * t2 == x2 && ya + yc * t1 - xc * t2 == y2);
}
int main() {
  cin >> xa >> ya >> xb >> yb >> xc >> yc;
  for (int i = 0; i < 4; i++) {
    X[i] = d[i][0][0] * xb + d[i][0][1] * yb;
    Y[i] = d[i][1][0] * xb + d[i][1][1] * yb;
  }
  if (xc == 0 && yc == 0) {
    for (int i = 0; i < 4; i++) {
      if (xa == X[i] && ya == Y[i]) {
        puts("YES");
        return 0;
      }
    }
  } else {
    for (int i = 0; i < 4; i++)
      if (dd(X[i], Y[i])) {
        puts("YES");
        return 0;
      }
  }
  puts("NO");
  return 0;
}
