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;
bool verify(pair<long long, long long> b, pair<long long, long long> c) {
  long long num1 = b.first * c.second - b.second * c.first,
            den1 = c.first * c.first + c.second * c.second;
  if (den1 == 0) return b == c;
  if (num1 % den1 != 0) return 0;
  long long k2 = num1 / den1;
  long long num2 = b.first - k2 * c.second, den2 = c.first;
  long long num2a = b.second + k2 * c.first, den2a = c.second;
  if (den2 == 0) {
    if (den2a == 0) {
      return (num2 == 0 and num2a == 0);
    } else {
      return num2a % den2a == 0;
    }
  }
  if (num2 % den2 != 0) return 0;
  long long k1 = num2 / den2;
  return 1;
}
int main() {
  pair<long long, long long> a, b, c;
  cin >> a.first >> a.second >> b.first >> b.second >> c.first >> c.second;
  bool ret = verify(make_pair(b.first - a.first, b.second - a.second), c);
  ret |= verify(make_pair(b.first - a.second, b.second + a.first), c);
  ret |= verify(make_pair(b.first + a.first, b.second + a.second), c);
  ret |= verify(make_pair(b.first + a.second, b.second - a.first), c);
  if (ret)
    cout << "YES" << endl;
  else
    cout << "NO" << endl;
}
