#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
using ll = long long;
using ull = unsigned long long;

constexpr int n = 2;
constexpr int MOD = 67;
using Mat = array<array<int, n>, n>;

inline Mat mul(const Mat &a, const Mat &b) {
  Mat c;
  rep(i, n) rep(j, n) c[i][j] = 0;
  rep(i, n) rep(j, n) rep(k, n) c[i][j] = (c[i][j] + a[i][k] * b[k][j]) % MOD;
  return c;
}

int main() {
  cin.tie(nullptr)->sync_with_stdio(false);
  Mat x, y;
  rep(i, n) rep(j, n) cin >> x[i][j];
  rep(i, n) rep(j, n) cin >> y[i][j];
  rep(a, MOD) rep(b, MOD) rep(c, MOD) rep(d, MOD) {
    if (((a * d - b * c) % MOD + MOD) % MOD != 0) {
      Mat p;
      p[0][0] = a, p[0][1] = b, p[1][0] = c, p[1][1] = d;
      Mat pa = mul(p, x), bp = mul(y, p);
      if (pa == bp) {
        cout << "Yes" << '\n';
        // cerr << a << ' ' << b << ' ' << c << ' ' << d << '\n';
        return 0;
      }
    }
  }
  cout << "No" << '\n';
  return 0;
}