#include<bits/stdc++.h>
using namespace std;
int main()
{
int t;
cin >> t;
while(t--){
int n;
cin >> n ;
long long ara[n+1];
for(int i = 1 ; i <= n ; i++)
cin >> ara[i];
vector<int> v;
int noB [32];
int c =0 ;
for(int j = 1 ; j<= 31; j++)
{
int cr = 0;
for(int i = 1 ; i <= n; i++)
{
if(ara[i]&(1 << j-1))cr++;
}
noB[j] = cr;
}
for(int i = 1 ; i <= n ; i++)
{
int cnt = 0;
for(int k = 1 ; k <=30;k++)
{
if(noB[k] % i == 0)
{
continue;
}
else cnt++;
}
if(cnt == 0)cout << i << " ";
}
cout << endl;
}
}
406. Queue Reconstruction by Height | 380. Insert Delete GetRandom O(1) |
332. Reconstruct Itinerary | 368. Largest Divisible Subset |
377. Combination Sum IV | 322. Coin Change |
307. Range Sum Query - Mutable | 287. Find the Duplicate Number |
279. Perfect Squares | 275. H-Index II |
274. H-Index | 260. Single Number III |
240. Search a 2D Matrix II | 238. Product of Array Except Self |
229. Majority Element II | 222. Count Complete Tree Nodes |
215. Kth Largest Element in an Array | 198. House Robber |
153. Find Minimum in Rotated Sorted Array | 150. Evaluate Reverse Polish Notation |
144. Binary Tree Preorder Traversal | 137. Single Number II |
130. Surrounded Regions | 129. Sum Root to Leaf Numbers |
120. Triangle | 102. Binary Tree Level Order Traversal |
96. Unique Binary Search Trees | 75. Sort Colors |
74. Search a 2D Matrix | 71. Simplify Path |