#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(ll i=0;i<n;i++)
#define repl(i,l,r) for(ll i=(l);i<(r);i++)
#define per(i,n) for(ll i=(n)-1;i>=0;i--)
#define perl(i,r,l) for(ll i=r-1;i>=l;i--)
#define all(x) (x).begin(),(x).end()
#define CST(x) cout<<fixed<<setprecision(x)
#define vtpl(x,y,z) vector<tuple<x,y,z>>
#define rev(x) reverse(x);
using ll=long long;
using vl=vector<ll>;
using vvl=vector<vector<ll>>;
using pl=pair<ll,ll>;
using vpl=vector<pl>;
using vvpl=vector<vpl>;
const ll MOD=1000000007;
const ll MOD9=998244353;
const int inf=1e9+10;
const ll INF=4e18;
const ll dy[9]={1,0,-1,0,1,1,-1,-1,0};
const ll dx[9]={0,1,0,-1,1,-1,1,-1,0};
template<class T> inline bool chmin(T& a, T b) {
    if (a > b) {
        a = b;
        return true;
    }
    return false;
}
template<class T> inline bool chmax(T& a, T b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}
 
vvl matmul(vvl a,vvl b){
    vvl c(2,vl(2));
    rep(i,2)rep(j,2)rep(k,2){
        c[i][j]+=a[i][k]*b[k][j];
    }
    rep(i,2)rep(j,2)c[i][j]%=67;
    return c;
}

int main(){
    vvl a(2,vl(2)),b(2,vl(2));
    rep(i,2)rep(j,2)cin >> a[i][j];
    rep(i,2)rep(j,2)cin >> b[i][j];
    ll P=67;
    rep(i,67)rep(j,67)rep(k,67)rep(l,67){
        vvl p={{i,j},{k,l}};
        ll d=i*l-j*k;
        d=(d%P+P)%P;
        if(d==0)continue;
        if(matmul(p,a)==matmul(b,p)){
            cout << "Yes" << endl;
            return 0;
        }
    }
    cout << "No" << endl;

}