#include <iostream>
#include <algorithm>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <numeric>
#include <bitset>
#include <cmath>

static const int MOD = 1000000007;
using ll = long long;
using u32 = unsigned;
using u64 = unsigned long long;
using namespace std;

template<class T> constexpr T INF = ::numeric_limits<T>::max()/32*15+208;


int main() {
    auto lcm = [&](ll x, ll y){ return x/__gcd(x, y)*y; };
    auto g = [&](ll x, ll y){
        ll a = 1;
        for (int i = 1; i <= y; ++i) {
            (a *= x) %= y;
            if(a == 1) return i;
        }
        return 0;
    };
    ll a, b, c, d, e, f;
    while(cin >> a >> b >> c >> d >> e >> f, a){
        cout << lcm(g(a, b), lcm(g(c, d), g(e, f))) << "\n";
    }
    return 0;
}
