1
#include<bits/stdc++.h>
2

3
using namespace std;
4

5
const int N = 50000;
6
int prime[N + 2];
7
int vis[N + 2];
8
int cnt = 0;
9
long long a0, a1, b0, b1;
10
int main()
11
{
12
//  vis[2] = 1;
13
  for(int i = 2;i <= N;i++)
14
  {
15
    if(vis[i]) continue;
16
    prime[++cnt] = i;
17
    for(int j = i;j <= N;j += i)
18
    {
19
      vis[j] = 1;
20
    }
21
  }
22
  int n;
23
  scanf("%d", &n);
24
  while(n --)
25
  {
26
    scanf("%lld%lld%lld%lld", &a0, &a1, &b0, &b1);
27
    long long ans = 1;
28
    bool ok = 1;
29
    for(int i = 1;i <= cnt;i++)
30
    {
31
      long long d = 0, g = 0, c = 0, f = 0;
32
      while(a0 % prime[i] == 0)
33
      {
34
        a0 /= prime[i];
35
        c++;
36
      }
37
      while(a1 % prime[i] == 0)
38
      {
39
        a1 /= prime[i];
40
        f++;
41
      }
42
      while(b0 % prime[i] == 0)
43
      {
44
        b0 /= prime[i];
45
        d++;
46
      }
47
      while(b1 % prime[i] == 0)
48
      {
49
        b1 /= prime[i];
50
        g++;
51
      }
52
      if(d == g && c == f)
53
      {
54
        ans *= (g - f + 1);
55
      }
56
      else if(d > g || c < f || ((d != g) && (c != f) && (g != f)))
57
      {
58
        ok = 0;
59
        break;
60
      }
61
//      cout << prime[i] << " " << d << " " << g << " " << c << " " << f << endl;
62
    }
63
    vector<int> qwq;
64
    if(a0 != 1) qwq.push_back(a0);
65
    if(a1 != 1) qwq.push_back(a1);
66
    if(b0 != 1) qwq.push_back(b0);
67
    if(b1 != 1) qwq.push_back(b1);
68
    sort(qwq.begin(), qwq.end());
69
    for(int i = 0;i < qwq.size();i++)
70
    {
71
//      cout << i << endl;
72
      long long d = 0, g = 0, c = 0, f = 0;
73
      while(a0 % qwq[i] == 0)
74
      {
75
        a0 /= qwq[i];
76
        c++;
77
      }
78
      while(a1 % qwq[i] == 0)
79
      {
80
        a1 /= qwq[i];
81
        f++;
82
      }
83
      while(b0 % qwq[i] == 0)
84
      {
85
        b0 /= qwq[i];
86
        d++;
87
      }
88
      while(b1 % qwq[i] == 0)
89
      {
90
        b1 /= qwq[i];
91
        g++;
92
      }
93
      if(d == g && c == f)
94
      {
95
        ans *= (g - f + 1);
96
      }
97
      else if(d > g || c < f || ((d != g) && (c != f) && (g != f)))
98
      {
99
        ok = 0;
100
        break;
101
      }
102
    }
103

104
    if(!ok) cout << 0 << endl;
105
    else cout << ans << endl;
106
  }
107

108
  return 0;
109
}