#include<bits/stdc++.h>
#define fi first
#define se second
#define pb push_back
#define SZ(x) ((int)x.size())
#define L(i,u) for (register int i=head[u]; i; i=nxt[i])
#define rep(i,a,b) for (register int i=(a); i<=(b); i++)
#define per(i,a,b) for (register int i=(a); i>=(b); i--)
using namespace std;
typedef long long ll;
typedef unsigned int ui;
typedef pair<int,int> Pii;
typedef vector<int> Vi;
template<class T> inline void read(T &x){
    x=0; char c=getchar(); int f=1;
    while (!isdigit(c)) {if (c=='-') f=-1; c=getchar();}
    while (isdigit(c)) {x=x*10+c-'0'; c=getchar();} x*=f;
}
template<class T> inline void umin(T &x, T y){x=x<y?x:y;}
template<class T> inline void umax(T &x, T y){x=x>y?x:y;}
inline ui R() {
    static ui seed=416;
    return seed^=seed>>5,seed^=seed<<17,seed^=seed>>13;
}

int main() {
    int T;read(T);
    while(T--){
        int n,m;read(n);m=0;int t=n;
        while(t)m+=t%10,t/=10;
        Vi ans;
        rep(i,1,m)if(m%i==0&&n%i==0)ans.pb(i);
        printf("%d\n",SZ(ans));
        rep(i,0,SZ(ans)-1){
            printf("%d",ans[i]);
            if(i+1<=SZ(ans)-1)putchar(' ');
        }
        puts("");
    }
    return 0;
}