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;
inline void pisz(int n) { printf("%d\n", n); }
template <typename T, typename TT>
ostream& operator<<(ostream& s, pair<T, TT> t) {
  return s << "(" << t.first << "," << t.second << ")";
}
template <typename T>
ostream& operator<<(ostream& s, vector<T> t) {
  for (int(i) = 0; (i) < (t.size()); ++(i)) s << t[i] << " ";
  return s;
}
bool check(long long cx, long long cy, long long ux, long long uy) {
  if (cx == 0 && cy == 0) {
    return (cx == ux && cy == uy);
  }
  long long detA = -cx * cx - cy * cy;
  long long detA1 = -cx * ux - cy * uy;
  long long detA2 = cx * uy - ux * cy;
  if (detA1 % detA != 0) return false;
  if (detA2 % detA != 0) return false;
  return true;
}
int main() {
  int(ax1), (ay1);
  scanf("%d %d", &(ax1), &(ay1));
  int(bx1), (by1);
  scanf("%d %d", &(bx1), &(by1));
  int(cx1), (cy1);
  scanf("%d %d", &(cx1), &(cy1));
  long long ax = ax1, bx = bx1, cx = cx1, ay = ay1, by = by1, cy = cy1;
  vector<pair<long long, long long> > v;
  v.push_back(make_pair(bx - ax, by - ay));
  v.push_back(make_pair(bx - ay, by + ax));
  v.push_back(make_pair(bx + ax, by + ay));
  v.push_back(make_pair(bx + ay, by - ax));
  for (int(j) = 0; (j) < (4); ++(j))
    if (check(cx, cy, v[j].first, v[j].second)) {
      printf("YES\n");
      return 0;
    }
  printf("NO\n");
}
