#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll mod = 1e9 + 7;
const int N = 200005;
const int INF = 0x3f3f3f3f;
ll lcm(ll x, ll y) {
if (x == 0 || y == 0) return 0;
ll g = gcd(x, y);
if (x / g > LLONG_MAX / y) return LLONG_MAX;
return x / g * y;
}
int main() {
int _;
cin >> _;
while (_--) {
ll n, a, b, c;
cin >> n >> a >> b >> c;
ll l = lcm(a, b);
ll k1 = n / a - ((l <= n && l != 0) ? (n / l) : 0);
ll k2 = n / c;
ll lac = lcm(a, c);
ll tmp = lcm(lac, b);
ll k3 = ((lac <= n && lac != 0) ? (n / lac) : 0) - ((tmp <= n && tmp != 0) ? (n / tmp) : 0);
// cout << k1 << " " << k2 << " " << k3 << endl;
cout << k1 + k2 - k3 << "\n";
}
return 0;
}