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>
#pragma GCC optimize("O2")
#pragma comment(linker, "/STACK:16777216")
using namespace std;
const int N = 1001;
long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; }
long long x, y, dx, dy, xx, yy;
bool ok(long long tx, long long ty) {
  long long d = gcd(abs(dx), abs(dy));
  if (d == 0) {
    return tx == 0 && ty == 0;
  }
  if (tx % d || ty % d) return false;
  long long temp = dx * dx + dy * dy;
  if (temp == 0) {
    return tx == ty;
  } else {
    long long sum1 = tx * dx + dy * ty;
    long long sum2 = dy * tx - dx * ty;
    return sum1 % temp == 0 && sum2 % temp == 0;
  }
}
bool judge() {
  if (ok(x - xx, y - yy) || ok(x + xx, y + yy) || ok(x + yy, y - xx) ||
      ok(x - yy, y + xx))
    return true;
  return false;
}
int main() {
  while (cin >> x >> y >> xx >> yy >> dx >> dy) {
    puts(judge() ? "YES" : "NO");
  }
}
