#include <iostream>
#include <string>
#include <sstream>
#include <algorithm>
#include <vector>
#include <utility>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <map>
#include <set>
#include <stack>
#include <queue>
 
using namespace std;
 
#define pb(n)	push_back(n)
#define mp(n,m) make_pair(n,m)
#define fi 	first
#define se 	second
#define all(r) (r).begin(),(r).end()

#define rep(i,n) for(int i=0; i<(n); i++)
#define repc(i,a,b) for(int i=(a); i<(b); i++)

typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
 
const int IMAX=((1<<30)-1)*2+1;
const double EPS=1e-10;
//int mod=1000000007


int main(){
	vi a(3,0),m(3,0),z(3,0),co(3,1),o(3,1);
	int ans;
	while(1){
		rep(i,3)cin>>a[i]>>m[i];
		if(a==z&&m==z)break;
		ans=0;
		do{
			rep(i,3){
				co[i]=a[i]*co[i]%m[i];
			}
			ans++;
		}while(co!=o);
		cout<<ans<<endl;
	}
}