#include<stdio.h>
#include<cmath>
#include<algorithm>
#include<iostream>
#include<set>
#include<map>
#include<cstring>
#include<string>
#include<queue>
using namespace std;
int main() {
    int T;
    scanf("%d", &T);
    for (int tt = 0; tt < T; ++tt) {
        int v;
        scanf("%d", &v);
        int vv = v, v2 = 0;
        while(vv) {
            v2 += vv%10;
            vv /= 10;
        }
        vector<int> ans;
        for (int i=1;i<=v2;++i) {
            if (v2%i==0 && v%i==0) {
                ans.push_back(i);
            }
        }
        printf("%d\n", ans.size());
        for (int i=0;i<ans.size();++i) {
            printf("%d",ans[i]);
            if (i==ans.size()-1) puts("");
            else putchar(' ');
        }
    }
    return 0;
}