#include <bits/stdc++.h>
using namespace std;
long long n, m, b[300005], cnt, a[300005], t, ans, ac, anss[300005];
map<int, int>mp;

int main() {
	cin >> t;
	while (t--) {
		cin >> n;
		for (int i = 1; i <= n; i++) {
			cin >> a[i];
			if (!mp[a[i]]) {
				cnt++;
				b[cnt] = a[i];
			}
			mp[a[i]]++;
		}
		sort(b + 1, b + cnt + 1);
		for (int i = 1; i <= n; i++) {
			int tot = 0;
			int cnt1 = 0;
			for (int j = 1; j <= cnt; j++) {
				if (a[i] % b[j] != 0 && b[j] <= a[i]) {
					cnt1 += mp[b[j]];
				}
				if (b[j] > a[i]) {
					cnt1 += mp[b[j]];
				}
				if (cnt1 > 1) {
					tot = 1;
					break;
				}
			}
			if (i == 4) {
//				cout << "i " << i << " " << cnt1 << endl;
			}
			if (tot == 0 && cnt1 <= 1) {
				ans++;
				ac++;
				anss[ac] = i;
			}
		}
		cout << ans << endl;
		for (int i = 1; i <= ac; i++) {
			cout << anss[i] << " ";
		}
		cout << endl;
		ac = 0;
		ans = 0;
		cnt = 0;
		mp.clear();
	}
	return 0;
}