Problem: Arpa is taking a geometry exam. Here is the last problem of the exam.

You are given three points a, b, c.

Find a point and an angle such that if we rotate the page around the point by the angle, the new position of a is the same as the old position of b, and the new position of b is the same as the old position of c.

Arpa is doubting if the problem has a solution or not (i.e. if there exists a point and an angle satisfying the condition). Help Arpa determine if the question has a solution or not.

Input

The only line contains six integers ax, ay, bx, by, cx, cy (|ax|, |ay|, |bx|, |by|, |cx|, |cy| ≤ 109). It's guaranteed that the points are distinct.

Output

Print "Yes" if the problem has a solution, "No" otherwise.

You can print each letter in any case (upper or lower).

Examples

Input

0 1 1 1 1 0


Output

Yes


Input

1 1 0 0 1000 1000


Output

No

Note

In the first sample test, rotate the page around (0.5, 0.5) by <image>.

In the second sample test, you can't find any solution.

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
long long int power(long long int x, long long int y) {
  if (y == 0)
    return 1;
  else if (y % 2 == 0)
    return power(x, y / 2) * power(x, y / 2);
  else
    return x * power(x, y / 2) * power(x, y / 2);
}
double slope(long long int x1, long long int y1, long long int x2,
             long long int y2) {
  return (double)((double)(y2 - y1) / (x2 - x1));
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  long long int ax, ay, bx, by, cx, cy;
  cin >> ax >> ay >> bx >> by >> cx >> cy;
  long long int dab = power((bx - ax), 2) + power((by - ay), 2);
  long long int dbc = power((cx - bx), 2) + power((cy - by), 2);
  if (dab != dbc) {
    cout << "No\n";
  } else if (slope(ax, ay, bx, by) == slope(bx, by, cx, cy)) {
    cout << "No\n";
  } else {
    cout << "Yes\n";
  }
  return 0;
}