#include <iostream>
#include <iomanip>//小数点出力用
//cout << fixed << setprecision(10) << ans;
#include <cmath>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <unordered_map>
using ll = long long;
using namespace std;
#define modPHash (ll)((1LL<<61)-1)
#define modP (ll)998244353
bool chkrng0idx(int pos, int sup) { return (0 <= pos && pos < sup); }
int clk4(int num) { return (num - 2) * (num % 2); }
void yn(bool tf) { cout << (tf ? "Yes\n" : "No\n"); }

vector<vector<ll>> mul(vector<vector<ll>>& A, vector<vector<ll>>& B, int size) {
	vector<vector<ll>>res;
	for (int i = 0; i < size; i++) {
		vector<ll>row;
		for (int j = 0; j < size; j++) {
			ll tmp = 0;
			for (int k = 0; k < size; k++) {
				tmp += A[i][k] * B[k][j];
			}
			row.push_back(tmp);
		}
		res.push_back(row);
	}
	return res;
}

int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	vector<ll>I(2);
	vector<vector<ll>>A(2, I), B(2, I);
	for (int i = 0;i < 2;i++) {
		for (int j = 0;j < 2;j++) {
			cin >> A[i][j];
		}
	}
	for (int i = 0;i < 2;i++) {
		for (int j = 0;j < 2;j++) {
			cin >> B[i][j];
		}
	}
	vector<vector<ll>>P(2, I);
	for (int i = 0;i < 67;i++) {
		for (int j = 0;j < 67;j++) {
			for (int k = 0;k < 67;k++) {
				for (int l = 0;l < 67;l++) {
					if ((i * l) % 67 == (j * k) % 67)continue;
					bool ok = 1;
					if ((A[0][0] * i + A[1][0] * j) % 67 != (B[0][0] * i + B[0][1] * k) % 67) {
						ok = 0;
					}

					if ((A[0][1] * i + A[1][1] * j) % 67 != (B[0][0] * j + B[0][1] * l) % 67) {
						ok = 0;
					}

					if ((A[0][0] * k + A[1][0] * l) % 67 != (B[1][0] * i + B[1][1] * k) % 67) {
						ok = 0;
					}
					if ((A[0][1] * k + A[1][1] * l) % 67 != (B[1][0] * j + B[1][1] * l) % 67) {
						ok = 0;
					}
					if (ok) {
						yn(1);
						return 0;
					}
				}
			}
		}
	}
	yn(0);
	return 0;
}