#include <iostream>
#include <cassert>
#include <tuple>
#include <cstdio>
#include <algorithm>
using namespace std;

typedef long long ll;
typedef __int128_t lll;

// x, mod
pair<lll,lll> crt(lll a1, lll m1, lll a2, lll m2){
  auto myabs = [](lll x){ return x > -x ? x : -x; };
  auto mul = [&myabs](lll a, lll b, lll m){
    a = a < 0 ? m - myabs(a)%m : a % m;
    b = b < 0 ? m - myabs(b)%m : b % m;
    return a*b%m;
  };
  auto extgcd = [](lll a, lll b, lll &x, lll &y) {
    for (lll u = y = 1, v = x = 0; a; ) {
      lll q = b / a;
      swap(x -= q * u, u);
      swap(y -= q * v, v);
      swap(b -= q * a, a);
    }
    return b;
  };
  lll k1,k2;
  lll g = extgcd(m1,m2,k1,k2);
  if(myabs(a1-a2)%g != 0){
    return make_pair(-1,-1);
  } else {
    lll l = m1 / g * m2;
    lll x = a1 + mul(mul((a2 - a1) / g, k1, l) , m1, l);
    return make_pair(x,l);
  }
}

pair<lll,lll> crt(vector<lll> a, vector<lll> m){
  lll mod = 1, ans = 0;
  int n = a.size();
  for(int i = 0; i < n; i++){
    tie(ans,mod) = crt(ans, mod, a[i], m[i]);
    if(ans == -1) return make_pair(-1,-1);
  }
  return make_pair(ans,mod);
}

int main(){
  int n = 3;
  while(1){
    vector<lll> x(n), y(n);
    for(int i = 0; i < n; i++){
      ll xx,yy;
      if(!(cin >> xx >> yy)) exit(0);
      x[i] = xx, y[i] = yy;
    }
    lll ans,m;
    tie(ans,m) = crt(x,y);
    if(ans == 0) ans = m;
    cout << (ll)ans << endl;
  }
}