#include <bits/stdc++.h>
using namespace std;
#define ll long long
const int MAXN = 6000000;
int main() {
vector<bool> sieve(MAXN);
vector<int> primes;
for (int i = 2; i < MAXN; i++) {
if (sieve[i]) continue;
primes.push_back(i);
for (int j = i; j < MAXN; j += i) {
sieve[j] = 1;
}
}
vector<ll> psum(primes.size(), 0);
for (int i = 0; i < (int) primes.size(); i++) {
psum[i] = (i ? psum[i - 1] : 0) + primes[i];
}
cin.tie(0)->sync_with_stdio(0);
int t; cin >> t;
while (t--) {
int n; cin >> n;
vector<int> a(n);
for (int &x : a) {
cin >> x;
}
sort(a.rbegin(), a.rend());
int ans = 0;
ll sum = 0;
for (int i = 0; i < n; i++) {
sum += a[i];
if (sum >= psum[i]) {
ans = i + 1;
}
}
cout << n - ans << '\n';
}
}
I2luY2x1ZGUgPGJpdHMvc3RkYysrLmg+CnVzaW5nIG5hbWVzcGFjZSBzdGQ7CiNkZWZpbmUgbGwgbG9uZyBsb25nCgpjb25zdCBpbnQgTUFYTiA9IDYwMDAwMDA7CgppbnQgbWFpbigpIHsKCXZlY3Rvcjxib29sPiBzaWV2ZShNQVhOKTsKCXZlY3RvcjxpbnQ+IHByaW1lczsKCWZvciAoaW50IGkgPSAyOyBpIDwgTUFYTjsgaSsrKSB7CgkJaWYgKHNpZXZlW2ldKSBjb250aW51ZTsKCQlwcmltZXMucHVzaF9iYWNrKGkpOwoJCWZvciAoaW50IGogPSBpOyBqIDwgTUFYTjsgaiArPSBpKSB7CgkJCXNpZXZlW2pdID0gMTsKCQl9Cgl9Cgl2ZWN0b3I8bGw+IHBzdW0ocHJpbWVzLnNpemUoKSwgMCk7Cglmb3IgKGludCBpID0gMDsgaSA8IChpbnQpIHByaW1lcy5zaXplKCk7IGkrKykgewoJCXBzdW1baV0gPSAoaSA/IHBzdW1baSAtIDFdIDogMCkgKyBwcmltZXNbaV07Cgl9CgoJY2luLnRpZSgwKS0+c3luY193aXRoX3N0ZGlvKDApOwoJaW50IHQ7IGNpbiA+PiB0OwoJd2hpbGUgKHQtLSkgewoJCWludCBuOyBjaW4gPj4gbjsKCQl2ZWN0b3I8aW50PiBhKG4pOwoKCQlmb3IgKGludCAmeCA6IGEpIHsKCQkJY2luID4+IHg7CgkJfQoKCQlzb3J0KGEucmJlZ2luKCksIGEucmVuZCgpKTsKCQlpbnQgYW5zID0gMDsKCQlsbCBzdW0gPSAwOwoJCWZvciAoaW50IGkgPSAwOyBpIDwgbjsgaSsrKSB7CgkJCXN1bSArPSBhW2ldOwoJCQlpZiAoc3VtID49IHBzdW1baV0pIHsKCQkJCWFucyA9IGkgKyAxOwkKCQkJfQoJCX0KCQljb3V0IDw8IG4gLSBhbnMgPDwgJ1xuJzsKCX0KfQoKCgo=