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;
long long gcd(long long a, long long b) {
  if (b == 0) return a;
  if (a % b == 0) return b;
  return gcd(b, a % b);
}
bool sub_main(long long X, long long Y, long long x, long long y) {
  if (x == 0 && y == 0) {
    if (X == 0 && Y == 0)
      cout << "YES" << endl;
    else
      return false;
    return true;
  }
  long long left = x * x + y * y;
  long long right = x * Y - X * y;
  if (right % left == 0) {
    long long tmp = right / left;
    if (x != 0 && (X + y * tmp) % x == 0) {
      cout << "YES" << endl;
      return true;
    } else if (x == 0 && X + y * tmp == 0 && (Y - x * tmp) % y == 0) {
      cout << "YES" << endl;
      return true;
    }
  }
  return false;
}
int main() {
  long long ax, ay, bx, by, cx, cy;
  cin >> ax >> ay >> bx >> by >> cx >> cy;
  for (long long i = 0; i < ((long long)4); i++) {
    long long tmp = ax;
    ax = -ay;
    ay = tmp;
    if (sub_main(bx - ax, by - ay, cx, cy)) return 0;
  }
  cout << "NO" << endl;
  return 0;
}
