#include <bits/stdc++.h>
using namespace std;
 
void solve() {
    long long n;
    cin >> n;
    vector<long long> ans;
 
    for (int k = 1; k <= 18; k++) {
        long long d = 1;
        for (int i = 0; i < k; i++) d *= 10;
        d += 1;
        if (n % d == 0) ans.push_back(n / d);
    }
 
    if (ans.empty()) cout << 0 << "\n";
    else {
        cout << ans.size() << "\n";
        for (auto x : ans) cout << x << " ";
        cout << "\n";
    }
}
 
int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
 
    int t;
    cin >> t;
    while (t--) solve();
}

I2luY2x1ZGUgPGJpdHMvc3RkYysrLmg+CnVzaW5nIG5hbWVzcGFjZSBzdGQ7Cgp2b2lkIHNvbHZlKCkgewogICAgbG9uZyBsb25nIG47CiAgICBjaW4gPj4gbjsKICAgIHZlY3Rvcjxsb25nIGxvbmc+IGFuczsKCiAgICBmb3IgKGludCBrID0gMTsgayA8PSAxODsgaysrKSB7CiAgICAgICAgbG9uZyBsb25nIGQgPSAxOwogICAgICAgIGZvciAoaW50IGkgPSAwOyBpIDwgazsgaSsrKSBkICo9IDEwOwogICAgICAgIGQgKz0gMTsKICAgICAgICBpZiAobiAlIGQgPT0gMCkgYW5zLnB1c2hfYmFjayhuIC8gZCk7CiAgICB9CgogICAgaWYgKGFucy5lbXB0eSgpKSBjb3V0IDw8IDAgPDwgIlxuIjsKICAgIGVsc2UgewogICAgICAgIGNvdXQgPDwgYW5zLnNpemUoKSA8PCAiXG4iOwogICAgICAgIGZvciAoYXV0byB4IDogYW5zKSBjb3V0IDw8IHggPDwgIiAiOwogICAgICAgIGNvdXQgPDwgIlxuIjsKICAgIH0KfQoKaW50IG1haW4oKSB7CiAgICBpb3M6OnN5bmNfd2l0aF9zdGRpbyhmYWxzZSk7CiAgICBjaW4udGllKDApOwoKICAgIGludCB0OwogICAgY2luID4+IHQ7CiAgICB3aGlsZSAodC0tKSBzb2x2ZSgpOwp9

NQoxMTExCjEyCjU1Cjk5OTk5OTk5OTk5OTk5OTk5OQoxMDAwMDAwMDAwMDAwMDAwMDAwCg==

5
1111
12
55
999999999999999999
1000000000000000000