#include<bits/stdc++.h>
using namespace std;
using LL=long long;

const int mo=1e9+7;
LL qpow(LL a,LL b)
{
    LL ans=1;
    a%=mo;
    while(b)
    {
        if(b&1)
            ans=ans*a%mo;
        b>>=1;
        a=a*a%mo;
    }
    return ans;
}

//----------------------------------

vector<int>v;
int main()
{
    int T;
    scanf("%d",&T);
    int n;
    while(T--)
    {
        scanf("%d",&n);
        v.clear();
        int res=0,x,i;
        x=n;
        while(x)
        {
            res+=x%10;
            x/=10;
        }
        
        for(i=1;i*i<n;i++)
        {
            if(n%i==0)
            {
                if(res%i==0)
                    v.push_back(i);
                if(res%(n/i)==0)
                    v.push_back(n/i);
                
            }
        }
        if(i*i==n)
        {
            if(res%i==0)
                v.push_back(i);
        }
        sort(v.begin(),v.end());
        printf("%d\n",v.size());
        for(i=0;i<v.size()-1;i++)
            printf("%d ",v[i]);
        printf("%d\n",v[i]);
    }    
    return 0;
}