#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 10;
int main() {
  long long ax, ay, bx, by, cx, cy;
  while (scanf("%I64d%I64d%I64d%I64d%I64d%I64d", &ax, &ay, &bx, &by, &cx,
               &cy) != EOF) {
    if (((ax - bx) * (ax - bx) + (ay - by) * (ay - by)) ==
        ((bx - cx) * (bx - cx) + (by - cy) * (by - cy))) {
      if ((2 * bx == ax + cx) && (2 * by == ay + cy)) {
        printf("No\n");
      } else {
        printf("Yes\n");
      }
    } else {
      printf("No\n");
    }
  }
  return 0;
}
