#include <bits/stdc++.h>
using namespace std;
const long mod = pow(10, 9) + 7;
const double pi = 3.141592653589793238;
long long countdivisors(long long n) {
  long long count = 0;
  for (long long i = 1; i <= sqrt(n); i++) {
    if (n % i == 0) {
      if (n / i == i) {
        count++;
      } else {
        count = count + 2;
      }
    }
  }
  return count;
}
void remove(std::vector<int> &v) {
  auto end = v.end();
  for (auto it = v.begin(); it != end; ++it) {
    end = std::remove(it + 1, end, *it);
  }
  v.erase(end, v.end());
}
bool isPerfectSquare(long long x) {
  long long s = sqrt(x);
  return (s * s == x);
}
bool isFibonacci(int n) {
  return isPerfectSquare(5 * n * n + 4) || isPerfectSquare(5 * n * n - 4);
}
int digSum(int n) {
  int sum = 0;
  while (n > 0) {
    sum += n % 10;
    n = n / 10;
  }
  return sum;
}
long long exponentMod(long long A, long long B, long long C) {
  if (A == 0) return 0;
  if (B == 0) return 1;
  long long y;
  if (B % 2 == 0) {
    y = exponentMod(A, B / 2, C);
    y = (y * y) % C;
  } else {
    y = A % C;
    y = (y * exponentMod(A, B - 1, C) % C) % C;
  }
  return (long long)((y + C) % C);
}
void sieve(int N) {
  bool isPrime[N + 1];
  for (int i = 0; i <= N; ++i) {
    isPrime[i] = true;
  }
  isPrime[0] = false;
  isPrime[1] = false;
  for (int i = 2; i * i <= N; ++i) {
    if (isPrime[i] == true) {
      for (int j = i * i; j <= N; j += i) isPrime[j] = false;
    }
  }
}
void solve() {
  double xa, ya, xb, yb, xc, yc;
  cin >> xa >> ya >> xb >> yb >> xc >> yc;
  double m1 = (yb - ya) / (xb - xa);
  double m2 = (yc - yb) / (xc - xb);
  double m3 = (yc - ya) / (xc - xa);
  if (m1 == m2 && m1 == m3) {
    cout << "NO";
  } else {
    double d1 = sqrt(((ya - yb) * (ya - yb)) + ((xa - xb) * (xa - xb)));
    double d2 = sqrt(((yc - yb) * (yc - yb)) + ((xc - xb) * (xc - xb)));
    if (d1 == d2) {
      cout << "YES";
    } else {
      cout << "NO";
    }
  }
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  int t = 1;
  while (t--) {
    solve();
  }
  return 0;
}
