#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <ctime>
#include <cassert>
#include <iostream>
#include <cctype>
#include <sstream>
#include <string>
#include <list>
#include <vector>
#include <queue>
#include <set>
#include <stack>
#include <map>
#include <utility>
#include <numeric>
#include <algorithm>
#include <iterator>
#include <bitset>
#include <complex>
#include <fstream>
using namespace std;
typedef long long ll;
const double EPS = 1e-9;
typedef vector<int> vint;
typedef pair<int, int> pint;
#define rep(i, n) REP(i, 0, n)
#define ALL(v) v.begin(), v.end()
#define MSG(a) cout << #a << " " << a << endl;
#define REP(i, x, n) for(int i = x; i < n; i++)
template<class T> T RoundOff(T a){ return int(a+.5-(a<0)); }
template<class T, class C> void chmax(T& a, C b){ if(a < b) a = b; }
template<class T, class C> void chmin(T& a, C b){ if(b < a) a = b; }
template<class T, class C> pair<T, C> mp(T a, C b){ return make_pair(a, b); }
bool check(vint aa, vint mm);
ll gcd(ll x, ll y);
ll lcm(ll x, ll y);
ll cnt(ll a, ll m);

bool check(vint aa, vint mm)
{
    rep(i, 3)
        if(aa[i] != 0 || mm[i] != 0)
            return true;
    
    return false;
}
//! gcd

ll gcd(ll x, ll y)
{    return y ? gcd(y, x % y) : x;	}


//! lcm
ll lcm(ll x, ll y)
{    return x * y / gcd(x, y);		}

ll cnt(ll a, ll m)
{
    ll n = 1, res = 0;
    
    do 
    {
        res++;
        
        n = a * n % m;
    }
    while(n != 1);
    
    return res;
}


int main()
{
    vint a(3), m(3);
    
    while(true)
    {
        rep(i, 3)
            cin >> a[i] >> m[i];
        
        if (!check(a, m))
            break;
        
        cout << lcm(cnt(a[0], m[0]), lcm(cnt(a[1], m[1]), cnt(a[2], m[2]))) << endl;
    }
}