#include #include #include using namespace std; using namespace atcoder; using ll = long long; //using mint = modint998244353; //using mint = modint1000000007; #define rep(i, n) for (int i = 0; i < (int)(n); i++) #define repu(i, s, t) for (int i = (int)(s); i < (int)(t); i++) #define repd(i, s, t) for (int i = (int)(s)-1; i >= (int)(t); i--) #define all(v) v.begin(), v.end() void _u() { cerr << endl; } template void _u(H&& h, T&&... t) { cerr << h << ", "; _u(move(t)...); } #define U(...) { cerr << #__VA_ARGS__ << ": "; _u(__VA_ARGS__); } template bool chmax(T &a, const T b) { if(a >= b) return false; a = b; return true; } template bool chmin(T &a, const T b) { if(a <= b) return false; a = b; return true; } template istream& operator>>(istream &in, vector &a) { for(T &x: a) in >> x; return in; } template ostream& operator<<(ostream &out, const vector &a) { for(const T &x: a) out << x << ' '; return out; } const int di[] = {1, 0, -1, 0, 1, 1, -1, -1, 0}; const int dj[] = {0, 1, 0, -1, -1, 1, 1, -1, 0}; int main() { cin.tie(0)->sync_with_stdio(0); const int P = 67; vector> a(2, vector(2)), b(2, vector(2)); rep(i, 2) rep(j, 2) { int tmp; cin >> tmp; a[i][j] = tmp; } rep(i, 2) rep(j, 2) { int tmp; cin >> tmp; b[i][j] = tmp; } vector> p(2, vector(2)); for(p[0][0] = 0; p[0][0] < P; p[0][0]++) for(p[0][1] = 0; p[0][1] < P; p[0][1]++) for(p[1][0] = 0; p[1][0] < P; p[1][0]++) for(p[1][1] = 0; p[1][1] < P; p[1][1]++) { if((p[0][0] * p[1][1]) % P == (p[0][1] * p[1][0]) % P) continue; bool ok = true; rep(i, 2) rep(j, 2) { int resa = 0, resb = 0; rep(k, 2) resa += p[i][k] * a[k][j], resb += b[i][k] * p[k][j]; if(resa % P != resb % P) ok = false; if(!ok) break; } if(ok) { cout << "Yes" << endl; return 0; } } cout << "No" << endl; return 0; }