#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll mod = 1e9 + 7;
const int N = 200005;
const int INF = 0x3f3f3f3f;
ll powmod(ll x, ll y) {
    ll res = 1;
    while (y) {
        if (y & 1) res = res * x % mod;
        y >>= 1;
        x = x * x % mod;
    }
    return res;
}
ll add(ll a, ll b) {
    return (a + b) % mod;
}
ll sub(ll a, ll b) {
    return (a - b + mod) % mod;
}
ll mul(ll a, ll b) {
    return a * b % mod;
}
ll A[2][2], B[2][2];
int main() {
    cin >> A[0][0] >> A[0][1];
    cin >> A[1][0] >> A[1][1];
    cin >> B[0][0] >> B[0][1];
    cin >> B[1][0] >> B[1][1];
    ll trA = add(A[0][0], A[1][1]);
    ll detA = sub(mul(A[0][0], A[1][1]), mul(A[0][1], A[1][0]));
    ll trB = add(B[0][0], B[1][1]);
    ll detB = sub(mul(B[0][0], B[1][1]), mul(B[0][1], B[1][0]));
    if (trA != trB || detA != detB) {
        cout << "No\n";
        return 0;
    }
    if (sub(mul(trA, trA), mul(4, detA)) != 0) {
        cout << "Yes\n";
    } else {
        ll t = mul(trA, (mod + 1) / 2);
        bool ok1 = (A[0][0] == t && A[1][1] == t && A[0][1] == 0 && A[1][0] == 0);
        bool ok2 = (B[0][0] == t && B[1][1] == t && B[0][1] == 0 && B[1][0] == 0);
        if (ok1 == ok2) {
            cout << "Yes\n";
        } else {
            cout << "No\n";
        }
    }

    return 0;
}