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>
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
using namespace std;
const long long N = 1e9 + 5, mod = 1e9 + 7;
struct pt {
  long long x, y;
} A, B, C;
long long dist(pt a) { return a.x * a.x + a.y * a.y; }
long long cross(pt a, pt b) { return a.x * b.y - a.y * b.x; }
long long dot(pt a, pt b) { return a.x * b.x + a.y * b.y; }
bool chk() {
  long long d = dist(C);
  if (d == 0) return A.x == B.x && A.y == B.y;
  pt tmp;
  tmp.x = A.x + B.x;
  tmp.y = A.y + B.y;
  long long v1 = dot(tmp, C);
  long long v2 = cross(tmp, C);
  if (v1 % d != 0 || v2 % d != 0) return 0;
  return 1;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  cin >> A.x >> A.y >> B.x >> B.y >> C.x >> C.y;
  for (long long i = 0; i < 4; i++) {
    if (chk()) return cout << "YES", 0;
    swap(A.x, A.y);
    A.y *= -1;
  }
  cout << "NO";
}
