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 double EPS = 10e-8;
bool solve(long long int Ax, long long int Ay, long long int Cx,
           long long int Cy, long long int CCx, long long int CCy) {
  long long int d = Cx * CCy - CCx * Cy;
  if (Ax == 0 and Ay == 0) return true;
  if (d < 0) d = -d;
  if (d == 0) return false;
  bool r = true;
  r = ((Ax * CCy - Ay * CCx) % d == 0);
  r = r and ((Cx * Ay - Cy * Ax) % d == 0);
  return r;
}
int main() {
  long long int Ax, Ay, Bx, By, Cx, Cy;
  cin >> Bx >> By >> Ax >> Ay >> Cx >> Cy;
  if (solve(Ax - Bx, Ay - By, Cx, Cy, Cy, -Cx) or
      solve(Ax - By, Ay + Bx, Cx, Cy, Cy, -Cx) or
      solve(Ax + Bx, Ay + By, Cx, Cy, Cy, -Cx) or
      solve(Ax + By, Ay - Bx, Cx, Cy, Cy, -Cx))
    cout << "YES" << endl;
  else
    cout << "NO" << endl;
  return 0;
}
