/*
written by- Piyush Golani
language- c++
country- India
College- N.I.T Jamshedpur
*/
#include <cmath>
#include <ctime>
#include <iostream>
#include <string>
#include <vector>
#include<cstdio>
#include<sstream>
#include<algorithm>
#include<cstdlib>
#include<cstring>
#include<map>
#include<set>
#include<queue>
#include<cctype>
using namespace std;
#define pb push_back
#define all(s) s.begin(),s.end()
#define f(i,a,b) for(int i=a;i<b;i++)
#define F(i,a,b) for(int i=a;i>=b;i--)
#define PI 3.1415926535897932384626433832795
#define INF 2000000000
#define BIG_INF 7000000000000000000LL
#define mp make_pair
#define eps 1e-9
#define LL long long
#define si(n) scanf("%d",&n)
#define sll(n) scanf("%lld",&n)
#define mod 1000000007
#define mm 10000000

string inttostring(int n)
{
    stringstream a;
    a<<n;
    return a.str();
}

int stringtoint(string A)
{
    istringstream a(A);
    int p;
    a>>p;
    return p;
}

//////////////////////////////////////////////////////

class GeometricProgressions {
public:
    int fac(LL num,set<int>& S)
    {
        for(LL c=2;c*c<=num;c++)
        {
            if(num%c==0)
            {
                S.insert(c);
                while(num%c==0) num/=c;
            }
        }
        if(num!=1) S.insert(num);
        return 0;
    }
    int dec(LL num,vector<int>& V, vector<int> A)
    {
        f(i,0,A.size())
        {
            if(num%A[i]==0)
            {
                int c=0;
                while(num%A[i]==0)
                {
                    c++;
                    num/=A[i];
                }
                V.pb(c);
            }
            else V.pb(0);
        }
        return 0;
    }
   int count( int b1, int q1, int n1, int b2, int q2, int n2 ) {
    if(b2==0 || q2<=1)
    {
        swap(b1,b2);
        swap(q1,q2);
        swap(n1,n2);
    }
    if(b1==0 || q1<=1)
    {
        set<LL> S;
        S.insert(b1);
        if(n1>1)
        S.insert(b1*q1);
        LL cur=b2;
        f(i,0,n2)
        {
            S.insert(cur);
            cur*=q2;
            if(cur>500000000)
            {
                return (n2-i-1)+S.size();
            }
        }
        return S.size();
    }

    set<int> factors;
    fac(b1,factors);
    fac(q1,factors);
    fac(b2,factors);
    fac(q2,factors);
    vector<int> FF(all(factors));

    set<vector<int> > SS;

    vector<int> req1,req2,reb1,reb2;

    dec(q1,req1,FF);
    dec(q2,req2,FF);
    dec(b1,reb1,FF);
    dec(b2,reb2,FF);

    f(i,0,n1)
    {
        SS.insert(reb1);
        f(i,0,reb1.size())
        {
            reb1[i]+=req1[i];
        }
    }

    f(i,0,n2)
    {
        SS.insert(reb2);
        f(i,0,reb2.size())
        {
            reb2[i]+=req2[i];
        }
    }

    return SS.size();


   }
};

// BEGIN CUT HERE
namespace moj_harness {
    int run_test_case(int);
	void run_test(int casenum = -1, bool quiet = false) {
		if (casenum != -1) {
			if (run_test_case(casenum) == -1 && !quiet) {
				cerr << "Illegal input! Test case " << casenum << " does not exist." << endl;
			}
			return;
		}

		int correct = 0, total = 0;
		for (int i=0;; ++i) {
			int x = run_test_case(i);
			if (x == -1) {
				if (i >= 100) break;
				continue;
			}
			correct += x;
			++total;
		}

		if (total == 0) {
			cerr << "No test cases run." << endl;
		} else if (correct < total) {
			cerr << "Some cases FAILED (passed " << correct << " of " << total << ")." << endl;
		} else {
			cerr << "All " << total << " tests passed!" << endl;
		}
	}

	int verify_case(int casenum, const int &expected, const int &received, clock_t elapsed) {
		cerr << "Example " << casenum << "... ";

		string verdict;
		vector<string> info;
		char buf[100];

		if (elapsed > CLOCKS_PER_SEC / 200) {
			sprintf(buf, "time %.2fs", elapsed * (1.0/CLOCKS_PER_SEC));
			info.push_back(buf);
		}

		if (expected == received) {
			verdict = "PASSED";
		} else {
			verdict = "FAILED";
		}

		cerr << verdict;
		if (!info.empty()) {
			cerr << " (";
			for (int i=0; i<(int)info.size(); ++i) {
				if (i > 0) cerr << ", ";
				cerr << info[i];
			}
			cerr << ")";
		}
		cerr << endl;

		if (verdict == "FAILED") {
			cerr << "    Expected: " << expected << endl;
			cerr << "    Received: " << received << endl;
		}

		return verdict == "PASSED";
	}

	int run_test_case(int casenum__) {
		switch (casenum__) {
		case 0: {
			int b1                    = 3;
			int q1                    = 2;
			int n1                    = 5;
			int b2                    = 6;
			int q2                    = 2;
			int n2                    = 5;
			int expected__            = 6;

			clock_t start__           = clock();
			int received__            = GeometricProgressions().count(b1, q1, n1, b2, q2, n2);
			return verify_case(casenum__, expected__, received__, clock()-start__);
		}
		case 1: {
			int b1                    = 3;
			int q1                    = 2;
			int n1                    = 5;
			int b2                    = 2;
			int q2                    = 3;
			int n2                    = 5;
			int expected__            = 9;

			clock_t start__           = clock();
			int received__            = GeometricProgressions().count(b1, q1, n1, b2, q2, n2);
			return verify_case(casenum__, expected__, received__, clock()-start__);
		}
		case 2: {
			int b1                    = 1;
			int q1                    = 1;
			int n1                    = 1;
			int b2                    = 0;
			int q2                    = 0;
			int n2                    = 1;
			int expected__            = 2;

			clock_t start__           = clock();
			int received__            = GeometricProgressions().count(b1, q1, n1, b2, q2, n2);
			return verify_case(casenum__, expected__, received__, clock()-start__);
		}
		case 3: {
			int b1                    = 3;
			int q1                    = 4;
			int n1                    = 100500;
			int b2                    = 48;
			int q2                    = 1024;
			int n2                    = 1000;
			int expected__            = 100500;

			clock_t start__           = clock();
			int received__            = GeometricProgressions().count(b1, q1, n1, b2, q2, n2);
			return verify_case(casenum__, expected__, received__, clock()-start__);
		}

		// custom cases

/*      case 4: {
			int b1                    = ;
			int q1                    = ;
			int n1                    = ;
			int b2                    = ;
			int q2                    = ;
			int n2                    = ;
			int expected__            = ;

			clock_t start__           = clock();
			int received__            = GeometricProgressions().count(b1, q1, n1, b2, q2, n2);
			return verify_case(casenum__, expected__, received__, clock()-start__);
		}*/
/*      case 5: {
			int b1                    = ;
			int q1                    = ;
			int n1                    = ;
			int b2                    = ;
			int q2                    = ;
			int n2                    = ;
			int expected__            = ;

			clock_t start__           = clock();
			int received__            = GeometricProgressions().count(b1, q1, n1, b2, q2, n2);
			return verify_case(casenum__, expected__, received__, clock()-start__);
		}*/
/*      case 6: {
			int b1                    = ;
			int q1                    = ;
			int n1                    = ;
			int b2                    = ;
			int q2                    = ;
			int n2                    = ;
			int expected__            = ;

			clock_t start__           = clock();
			int received__            = GeometricProgressions().count(b1, q1, n1, b2, q2, n2);
			return verify_case(casenum__, expected__, received__, clock()-start__);
		}*/
		default:
			return -1;
		}
	}
}


int main(int argc, char *argv[]) {
	if (argc == 1) {
		moj_harness::run_test();
	} else {
		for (int i=1; i<argc; ++i)
			moj_harness::run_test(atoi(argv[i]));
	}
}
// END CUT HERE