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 int inf = 0x3f3f3f3f;
const double eps = 1e-6;
bool can(long long ax, long long ay, long long bx, long long by, long long cx,
         long long cy) {
  long long q = ax - bx;
  long long w = ay - by;
  if (!q && !w) {
    return true;
  }
  if (!cx && !cy) return false;
  if (!cx) {
    return (!(q % cy) && !(w % cy));
  }
  if (!cy) {
    return (!(q % cx) && !(w % cx));
  }
  long long up1 = (q * cx + w * cy);
  long long up2 = (q * cy - w * cx);
  long long down = (cx * cx + cy * cy);
  return !(up1 % down) && !(up2 % down);
}
int main() {
  long long ax, ay, bx, by, cx, cy;
  cin >> ax >> ay >> bx >> by >> cx >> cy;
  for (int t = 0; t < 4; t++) {
    if (can(ax, ay, bx, by, cx, cy)) {
      puts("YES");
      return 0;
    }
    long long z1 = bx;
    long long z2 = by;
    bx = z2;
    by = -z1;
  }
  puts("NO");
  return 0;
  return 0;
}
