#include <iostream>
#include <vector>
#include <cmath>
#include <map>
#include <set>
#include <iomanip>
#include <queue>
#include <algorithm>
#include <numeric>
#include <deque>
#include <complex>
#include <cassert>

using namespace std;

tuple<long long, long long, long long> ext_gcd(long long a, long long b){
    if (b == 0) return make_tuple(a, 1, 0);

    long long g, x, y;
    tie(g, y, x) = ext_gcd(b, a % b);
    y -= a / b * x;
    return make_tuple(g, x, y);
}

pair<long long, long long> CRT(vector<long long> &b, vector<long long> &m){
    long long r=0, lcm=1;
    for (int i=0; i<b.size(); i++){
        long long p, q, g;
        tie(g, p, q) = ext_gcd(lcm, m[i]);
        if ((b[i]-r) % g != 0) return make_pair(-1, 0); //No solution
        r += lcm * ((b[i]-r) / g * p % (m[i]/g));
        lcm *= m[i]/g;
    }

    return make_pair(((r%lcm)+lcm)%lcm, lcm);
}

int main(){

    vector<long long> b(3), m(3);
    for (int i=0; i<3; i++) cin >> b[i] >> m[i];
    long long x, l;
    tie(x, l) = CRT(b, m);
    cout << (x == 0 ? l : x) << endl;

    return 0;
}