#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;

using isize = size_t;
using i32 = int;
using u32 = unsigned int;
using i64 = long long;
using u64 = unsigned long long;
using i128 = __int128_t;
using u128 = __uint128_t;
using f64 = long double;
using p2 = pair<i64, i64>;
using el = tuple<i64, i64, i64>;
using mint = atcoder::modint998244353;

void _main();
int main() {
  cin.tie(0);
  ios::sync_with_stdio(false);
  _main();
}

i64 pow(i64 x, i64 n) {
  i64 res = 1;
  i64 t = x;
  while (n > 0) {
    if (n & 1) {
      res = res * t;
    }
    t = t * t;
    n >>= 1;
  }
  return res;
}
i64 pow(i64 x, i64 n, i64 m) {
  i64 res = 1;
  i64 t = x % m;
  while (n > 0) {
    if (n & 1) {
      res = res * t % m;
    }
    t = t * t % m;
    n >>= 1;
  }
  return res;
}

void _main() {
  vector<vector<i32>> A(2, vector<i32>(2));
  vector<vector<i32>> B(2, vector<i32>(2));
  for (i32 i = 0; i < 2; i++) {
    for (i32 j = 0; j < 2; j++) {
      cin >> A[i][j];
    }
  }
  for (i32 i = 0; i < 2; i++) {
    for (i32 j = 0; j < 2; j++) {
      cin >> B[i][j];
    }
  }
  i32 p = 67;
  vector<vector<i32>> P(2, vector<i32>(2, 0));
  for (i32 a = 0; a < p; a++) {
    for (i32 b = 0; b < p; b++) {
      for (i32 c = 0; c < p; c++) {
        for (i32 d = 0; d < p; d++) {
          i32 e = a * d - b * c;
          e = (e % p + p) % p;
          if (e == 0) continue;
          P[0][0] = a, P[0][1] = b, P[1][0] = c, P[1][1] = d;
          bool ok = true;
          for (i32 i = 0; i < 2; i++) {
            for (i32 j = 0; j < 2; j++) {
              i32 s = 0;
              for (i32 k = 0; k < 2; k++) {
                s += P[i][k] * A[k][j];
                s -= B[i][k] * P[k][j];
              }
              s = (s % p + p) % p;
              ok &= s == 0;
            }
          }
          if (ok) {
            cout << "Yes\n";
            return;
          }
        }
      }
    }
  }
  cout << "No\n";
}