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;
const long double eps = 1e-9;
long long xabs(long long a) { return a < 0 ? -a : +a; }
bool check(long long p, long long q, long long x, long long y, long long a,
           long long b) {
  if (a * x + b * y == p && a * y - b * x == q)
    return true;
  else
    return false;
}
bool can(long long ax, long long ay, long long bx, long long by, long long x,
         long long y) {
  long long p = bx - ax;
  long long q = by - ay;
  if (x == 0 && y == 0) {
    if (p == 0 && q == 0)
      return true;
    else
      return false;
  }
  if (y != 0) swap(x, y), swap(p, q);
  long long b = (p * y - q * x) / (y * y + x * x);
  long long a = (p - b * y) / x;
  if (check(p, q, x, y, a, b))
    return true;
  else
    return false;
}
int main() {
  long long ax, ay, bx, by, x, y;
  cin >> ax >> ay >> bx >> by >> x >> y;
  bool fl = false;
  for (int i = 0; i < 4; ++i) {
    fl |= can(ax, ay, bx, by, x, y);
    swap(ax, ay);
    ax = -ax;
  }
  if (fl)
    cout << "YES" << endl;
  else
    cout << "NO" << endl;
  return 0;
}
