#include <bits/stdc++.h>
#define pr(x) cout << #x << "= " << x << "  " ；
#define pl(x) cout << #x << "= " << x << endl;
#define ll __int64
using  namespace  std;
//typedef long long ll;

#define mst(ss,b) memset(ss,b,sizeof(ss));
#define For(i,j,n) for(int i=j;i<=n;i++)

template<class T> void read(T&num) {
    char CH; bool F=false;
    for(CH=getchar();CH<'0'||CH>'9';F= CH=='-',CH=getchar());
    for(num=0;CH>='0'&&CH<='9';num=num*10+CH-'0',CH=getchar());
    F && (num=-num);
}
int stk[70], tp;
template<class T> inline void print(T p) {
    if(!p) { puts("0"); return; }
    while(p) stk[++ tp] = p%10, p/=10;
    while(tp) putchar(stk[tp--] + '0');
    putchar('\n');
}

const int dx[] = {0, 0, 1, -1};
const int dy[] = {1, -1, 0, 0};
const ll mod=1e9+7;
const double pi=acos(-1.0);
const int inf=0x3f3f3f3f;
//const ll inf= 0x3f3f3f3f3f3f3f3fLL;
const int N=3e5+10;
const int maxn=1e3+20;
const double eps=1e-12;

ll a[N];
ll pre[N];

int  main(){
/*  std::ios::sync_with_stdio(false);
  std::cin.tie(0);*/
/*  #ifndef ONLINE_JUDGE
  freopen("in.txt","r",stdin);
  #endif*/

  int n,t;
  scanf("%d",&t);
  while(t--){
    scanf("%d",&n);
    mst(pre, 0);
    for(int i=1; i<=n; i++){
      read(a[i]);
      pre[i]=pre[i-1]+a[i];
    } 
    for(int i=1; i<n; i++){
      if(n%1!=0)continue;
      ll sum=pre[i];
      for(int j=2*i; j<=n; j+=i){
        if((pre[j]-pre[j-i])!=sum)break;
        if(j==n && (pre[j]-pre[j-i])==sum){
          printf("%d ",i);
        }
      }
    }
    printf("%d\n",n);
  }
  return 0;
}