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 aax, aay, bbx, bby, ccx, ccy;
long long num[3][5];
bool flag1, flag2, flag3, flag4;
long long gcd(long long x, long long y) { return y ? gcd(y, x % y) : x; }
long long lcm(long long x, long long y) { return (x * y) / gcd(x, y); }
bool check(long long ax, long long ay, long long bx, long long by, long long cx,
           long long cy) {
  if (cx * cx + cy * cy == 0) {
    if (ax == bx && ay == by)
      return 1;
    else
      return 0;
  } else {
    if ((cx * (by - ay) - cy * (bx - ax)) % (cx * cx + cy * cy) == 0 &&
        (cy * (by - ay) + cx * (bx - ax)) % (cx * cx + cy * cy) == 0)
      return 1;
    else
      return 0;
  }
}
int main() {
  scanf("%lld%lld%lld%lld%lld%lld", &aax, &aay, &bbx, &bby, &ccx, &ccy);
  flag1 = check(aax, aay, bbx, bby, ccx, ccy);
  flag2 = check(-aax, -aay, bbx, bby, ccx, ccy);
  flag3 = check(aay, -aax, bbx, bby, ccx, ccy);
  flag4 = check(-aay, aax, bbx, bby, ccx, ccy);
  if (flag1 || flag2 || flag3 || flag4)
    puts("YES");
  else
    puts("NO");
  return 0;
}
