#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<cstdlib>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> pr;
const double pi=acos(-1);
#define rep(i,a,n) for(int i=a;i<=n;i++)
#define per(i,n,a) for(int i=n;i>=a;i--)
#define Rep(i,u) for(int i=head[u];i;i=Next[i])
#define clr(a) memset(a,0,sizeof a)
#define pb push_back
#define mp make_pair
ld eps=1e-9;
ll pp=1000000007;
ll mo(ll a,ll pp){if(a>=0 && a<pp)return a;a%=pp;if(a<0)a+=pp;return a;}
ll powmod(ll a,ll b,ll pp){ll ans=1;for(;b;b>>=1,a=mo(a*a,pp))if(b&1)ans=mo(ans*a,pp);return ans;}
ll read(){
    ll ans=0;
    char last=' ',ch=getchar();
    while(ch<'0' || ch>'9')last=ch,ch=getchar();
    while(ch>='0' && ch<='9')ans=ans*10+ch-'0',ch=getchar();
    if(last=='-')ans=-ans;
    return ans;
}
//head
int q[100];
void solved(){
    int n = read();
    int m = 0, t = n;
    while(t){
        m+=t%10;
        t/=10;
    }
    q[0]=0;
    for(int i=1;i<=m;i++)
        if(m%i==0 && n%i==0){
            q[++q[0]]=i;
        }
    printf("%d\n",q[0]);
    if(q[0]){
        printf("%d",q[1]);
        for(int i=2;i<=q[0];i++)printf(" %d",q[i]);
        puts("");
    }
}
int main(){
    int T=read();
    while(T--)solved();
    return 0;
}