#include <bits/stdc++.h>

#define el '\n'
#define ll long long
#define ld long double

#define Beevo ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);

using namespace std;

ll pw[20];

void pre() {
    pw[0] = 1;

    for (int i = 1; i < 19; i++)
        pw[i] = pw[i - 1] * 10;
}

bool palindrome(string &s) {
    for (int i = 0; i < s.size(); i++) {
        if (s[i] != s[s.size() - i - 1])
            return 0;
    }

    return 1;
}

string closestPalindrome(string &s) {
    if (palindrome(s))
        return s;

    int n = s.size();

    if (count(s.begin(), s.end(), '0') == n - 1 && s[0] == '1')
        return max(string(n - 1, '9'), string("0"));

    string t = "0";
    for (int l = 0; l < n; l++) {
        ll x = stoll(s) - pw[n - l - 1];

        string cur = to_string(x);

        for (int i = 0; i < (n + 1) / 2; i++) {
            if (i > l)
                cur[i] = cur[n - i - 1] = '9';
            else {
                if (n - i - 1 > l)
                    cur[n - i - 1] = cur[i];
                else
                    cur[i] = cur[n - i - 1] = min(cur[i], cur[n - i - 1]);
            }
        }

        if (stoll(cur) > stoll(t))
            t = cur;
    }

    return t;
}

void testCase() {
    pre();

    string s;
    cin >> s;

    vector<string> v;

    while (s != "0") {
        v.push_back(closestPalindrome(s));

        s = to_string(stoll(s) - stoll(v.back()));
    }

    cout << v.size() << el;

    for (auto i: v)
        cout << i << el;
}

signed main() {
    Beevo

    int T = 1;
//    cin >> T;

    while (T--)
        testCase();

    return 0;
}