#include <bits/stdc++.h>
long long mod = 1e9;
long long MOD = 1e18;
using namespace std;
bool comp(pair<int, int> p, pair<int, int> q) {
  if (p.first != q.first) {
    return (p.first < q.first);
  } else {
    return (p.second < q.second);
  }
}
long long pp(long long a, long long b) {
  long long t = 1;
  while (b) {
    if (b & 1) t = (t * a) % mod;
    a = (a * a) % mod;
    b /= 2;
  }
  return t;
}
bool isprime(int n) {
  int i = 2;
  if (n == 1) return true;
  if (n == 2) return true;
  for (; i * i <= n; i++) {
    if (n % i == 0) return false;
  }
  return true;
}
long long lcd(long long n, long long m) {
  if (n > m) swap(m, n);
  if (m % n == 0)
    return m;
  else {
    int p = n + n;
    while (1) {
      if (p % m == 0)
        return p;
      else
        p = (n + p) % MOD;
    }
  }
}
int main() {
  int s, t, u, v, x, y;
  cin >> u >> v >> s >> t;
  cin >> x >> y;
  if (abs(s - u) % x == 0 && (abs(t - v) % y == 0)) {
    int c, d;
    c = abs(s - u) / x;
    d = abs(t - v) / y;
    if ((c % 2) == (d % 2)) {
      cout << "YES";
      return 0;
    }
  }
  cout << "NO";
  return 0;
}
