#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int Mod=998244353;
void solve() {
int n;
cin >> n;
vector<int> a(n);
for(int i=0;i<n;i++) cin >> a[i];
sort(a.begin(),a.end());
int ans = 2;
int l=0,r=2;
while(l<r-1 && r<n){
while(a[l]+a[l+1]<=a[r] && l<r-1) l++;
ans=max(ans,r-l+1);
r++;
}
cout << n-ans << '\n';
}
int main(){
ios::sync_with_stdio(false);
cin.tie(nullptr);
int t;
cin >> t;
while (t--) solve();
return 0;
}
I2luY2x1ZGUgPGJpdHMvc3RkYysrLmg+CnVzaW5nIG5hbWVzcGFjZSBzdGQ7CnR5cGVkZWYgbG9uZyBsb25nIGxsOwpjb25zdCBpbnQgTW9kPTk5ODI0NDM1MzsKCnZvaWQgc29sdmUoKSB7CgogICAgaW50IG47CiAgICBjaW4gPj4gbjsKICAgIHZlY3RvcjxpbnQ+IGEobik7CiAgICBmb3IoaW50IGk9MDtpPG47aSsrKSBjaW4gPj4gYVtpXTsKICAgIHNvcnQoYS5iZWdpbigpLGEuZW5kKCkpOwogICAgCiAgICBpbnQgYW5zID0gMjsKICAgIGludCBsPTAscj0yOwogICAgd2hpbGUobDxyLTEgJiYgcjxuKXsKICAgIAl3aGlsZShhW2xdK2FbbCsxXTw9YVtyXSAmJiBsPHItMSkgbCsrOwogICAgCWFucz1tYXgoYW5zLHItbCsxKTsKICAgIAlyKys7CiAgICB9CiAgICAKICAgIGNvdXQgPDwgbi1hbnMgPDwgJ1xuJzsKfQoKaW50IG1haW4oKXsgCiAgICBpb3M6OnN5bmNfd2l0aF9zdGRpbyhmYWxzZSk7CiAgICBjaW4udGllKG51bGxwdHIpOwoJCiAgICBpbnQgdDsKICAgIGNpbiA+PiB0OwogICAgd2hpbGUgKHQtLSkgc29sdmUoKTsKICAgIAoKICAgIHJldHVybiAwOwp9Cg==