#include <bits/stdc++.h>
using namespace std;
const long long int INF = 9223372036854775807LL;
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimization("unroint-loops")
long long int power(long long int a, long long int b, long long int m) {
  long long int res = 1;
  while (b) {
    if (b & 1) res = ((res % m) * (a % m)) % m;
    a = ((a % m) * (a % m)) % m;
    b >>= 1;
  }
  return res;
}
long long int power(long long int a, long long int b) {
  long long int res = 1;
  while (b) {
    if (b & 1) res *= a;
    a *= a;
    b >>= 1;
  }
  return res;
}
void solve() {
  long long int a, b, c, d, x, y;
  cin >> a >> b >> c >> d >> x >> y;
  if (abs(c - a) % x == 0 and abs(d - b) % y == 0) {
    long long int xx = abs(c - a) / x;
    long long int yy = abs(d - b) / y;
    if ((xx & 1 and yy & 1) or (xx & 1 ^ 1 and yy & 1 ^ 1))
      cout << "YES";
    else
      cout << "NO";
  } else
    cout << "NO";
}
signed main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  long long int tt = 1;
  while (tt--) {
    solve();
  }
  return 0;
}
