#include <bits/stdc++.h>
using namespace std;
bool check_prime(long long n) {
  long long flag = 0;
  for (long long i = 2; i * i <= n; i++) {
    if (n % i == 0) {
      flag = 1;
      break;
    }
  }
  if (n == 1)
    return false;
  else if (flag == 0 || n == 2 || n == 3) {
    return true;
  } else {
    return false;
  }
}
long long BE(long long x, long long n, long long m) {
  long long result = 1;
  while (n > 0) {
    if (n % 2 == 1) result = result * x % m;
    x = x * x % m;
    n = n / 2;
  }
  return result;
}
int32_t main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(0);
  long double a, b, c, d, e, f;
  cin >> a >> b >> c >> d >> e >> f;
  if (((a - c) * (a - c) + (b - d) * (b - d) !=
       (e - c) * (e - c) + (f - d) * (f - d)) ||
      ((a + e) / 2.0 == c && (b + f) / 2.0 == d))
    cout << "No" << '\n';
  else
    cout << "Yes" << '\n';
  return 0;
}
