#include using namespace std; using ll = long long; template T ext_gcd(T a, T b, T& x, T& y) { x = 1; y = 0; T x1 = 0, y1 = 1, a1 = a, b1 = b; while (b1 > 0) { T q = a1 / b1; tie(x, x1) = make_tuple(x1, x - q * x1); tie(y, y1) = make_tuple(y1, y - q * y1); tie(a1, b1) = make_tuple(b1, a1 - q * b1); } return a1; } template T crt_coprimes(vector a, vector m) { int k = a.size(); T prod = 1, ans = 0; for (int i = 0; i < k; i++) prod *= m[i]; for (int i = 0; i < k; i++) { T mi = prod / m[i], ni, y; ext_gcd(mi, m[i], ni, y); a[i] %= m[i]; ni %= m[i]; ans = (ans + a[i] * ni % m[i] * mi) % prod; } return (ans + prod) % prod; } template bool crt_general(vector a, vector m, T& ans) { int k = a.size(); map> mp; for (int i = 0; i < k; i++) { T tmp = m[i]; for (T j = 2; j * j <= tmp; j++) { if (tmp % j == 0) { T res = 1; while (tmp % j == 0) { tmp /= j; res *= j; } T ap = a[i] % res; if (mp.contains(j)) { if (mp[j].second < res) { swap(mp[j].first, ap); swap(mp[j].second, res); } if (mp[j].first % res != ap) { return false; } } else { mp[j] = make_pair(ap, res); } } } if (tmp > 1) { if (mp.contains(tmp)) { if ((mp[tmp].first - a[i]) % tmp) { return false; } } else { mp[tmp] = make_pair(a[i] % tmp, tmp); } } } vector na, nm; for (auto it = mp.begin(); it != mp.end(); it++) { na.push_back(it->second.first); nm.push_back(it->second.second); } ans = crt_coprimes(na, nm); return true; } int main() { cin.tie(nullptr); ios_base::sync_with_stdio(false); vector x(3), y(3); for (int i = 0; i < 3; i++) { cin >> x[i] >> y[i]; } ll ans; if (crt_general(x, y, ans)) { if (ans == 0) { ans = lcm(lcm(y[0], y[1]), y[2]); } cout << ans << "\n"; } else { cout << -1 << "\n"; } return 0; }