#include<cstdio>
#include<algorithm>
using namespace std;
#define rep(i,s,t) for(register int i=s;i<=t;++i)
int T;
int n;
inline int pp(int s){
    int sum=0;
    while(s)sum+=s%10,s/=10;
    return sum;
}
inline int gcd(int a,int b){
    return b?gcd(b,a%b):a;
}
int top;
int a[2333333];
int main(){
    scanf("%d",&T);
    while(T--){
        scanf("%d",&n);
        int g=gcd(pp(n),n);
        top=0;
        for(int i=1;i*i<=g;++i)
            if(g%i==0){
                a[++top]=i;
                if(i*i!=g)
                    a[++top]=g/i;
            }
        sort(a+1,a+top+1);
        printf("%d\n",top);
        rep(i,1,top-1)
            printf("%d ",a[i]);
        printf("%d\n",a[top]);
    }
    return 0;
}