#include <bits/stdc++.h>
#define ll long long
#define maxn 100005 
#define mod 998244353
#define db double
#define vi vector<int>
#define pb push_back
using namespace std;
ll ksm(ll a, ll b) {
   if (!b) return 1;
   ll ns = ksm(a, b >> 1);
   ns = ns * ns % mod;
   if (b & 1) ns = ns * a % mod;
   return ns;
}
int t; 
int ans[maxn], cnt;
int main() {
    cin >> t;
    for (int i = 0; i < t; i++) {
        cnt = 0;
        int a, b;
        cin >> a, b = a;
        int s = 0;
        while(b) s += b % 10, b /= 10;
        for (int j = 1; j <= s; j++)
            if (s % j) continue;
            else if (a % j) continue;
            else ans[cnt++] = j;
        cout << cnt << endl;
        for (int i = 0; i < cnt; i++) {
            cout << ans[i];
            if (i != cnt - 1) cout << ' ';
            else cout << endl;
        }
    }
    return 0;
}