#ifndef MY_HEADER #define MY_HEADER #include #include using namespace std; using namespace atcoder; using lint = long long; using ulint = unsigned long long; using llint = __int128_t; struct edge; using graph = vector>; #define endl '\n' constexpr int INF = 1<<30; constexpr lint INF64 = 1LL<<61; constexpr lint mod107 = 1e9+7; using mint107 = modint1000000007; constexpr long mod = 998244353; using mint = modint998244353; lint ceilDiv(lint x, lint y){if(x >= 0){return (x+y-1)/y;}else{return x/y;}} lint floorDiv(lint x, lint y){if(x >= 0){return x/y;}else{return (x-y+1)/y;}} lint Sqrt(lint x) {assert(x >= 0); lint ans = sqrt(x); while(ans*ans > x)ans--; while((ans+1)*(ans+1)<=x)ans++; return ans;} lint gcd(lint a,lint b){if(a 0){int a = n%10;char b = '0' + a;string c = "";c += b;n /= 10;ans = c + ans;}}return ans;} string toString(lint n, lint k){string ans = toString(n);string tmp = "";while(ans.length() + tmp.length() < k){tmp += "0";}return tmp + ans;} vectorprime;void makePrime(lint n){prime.push_back(2);for(lint i=3;i<=n;i+=2){bool chk = true;for(lint j=0;j= 0; i--) #define vec vector #define pb push_back #define eb emplace_back #define se second #define fi first #define al(x) x.begin(),x.end() #define ral(x) x.rbegin(),x.rend() struct edge{ edge(lint v, lint c = 1) {to = v, cost = c;} lint to; lint cost; }; #endif vecprod(vec&a, vec&b) { vecret(4); rep(i, 2) { rep(j, 2) { rep(k, 2) { ret[i*2+j] += a[i*2+k] * b[k*2 + j]; } } } return ret; } int main(){ vecA(4), B(4); rep(i, 4) cin >> A[i]; rep(i, 4) cin >> B[i]; const int p = 67; rep(a, p) { rep(b, p) { rep(c, p) { rep(d, p) { if((a*d - b*c + p*10000)%p == 0) continue; vecP = {a,b,c,d}; auto C = prod(P, A); auto D = prod(B, P); bool chk = true; rep(i, 4) { if(C[i]%p != D[i]%p) chk = false; } if(chk) { cout << "Yes" << endl; return 0; } } } } } cout << "No" << endl; return 0; }