#pragma GCC optimize("O3")
#pragma GCC optimize ("unroll-loops")
#pragma GCC target("avx,avx2,fma")

#include <bits/stdc++.h>

#define ll long long
#define ld  double
using namespace std;

const int N = 1e3 + 5, mod = 998244353;

const ll inf = 1e18;

ll pw[50];

vector<ll> ans;

string getString(ll n) {
    string ret = "";
    while(n > 0) {
        ret.push_back((char) (n % 10) + '0');
        n /= 10;
    }
    reverse(ret.begin(), ret.end());
    return ret;
}

void solvePowerOf10(ll n) {
    auto cur =  getString(n);
    if(cur[0] == '1') {
        ans.push_back(1);
        ans.push_back(n - 1);
    }
    else{
        int digit = 10 - (cur[0] - '0') + 1;
        // cout << n << ' ' << digit << ' ' << n - digit << '\n';
        ans.push_back(digit);
        ans.push_back(n - digit);
    }
}

bool isPlindrome(string s) {
    string t = s;
    reverse(t.begin(), t.end());
    return (s == t);
}

void solve(ll n) {
    if(n == 0) return;
    if(isPlindrome(getString(n))) {
        ans.push_back(n);
        return;
    }
    if(n < 10) {
        ans.push_back(n);
        return;
    }
    if(n >= 10 && n < 100) {
        for(int i = 1; i < 10; i++) {
            if(isPlindrome(getString(n - i))) {
                ans.push_back(i);
                ans.push_back(n - i);
                return;
            }
        }
    }
    auto cur = getString(n);
    int sz = cur.size();
    int midIdx = (sz - 1) / 2;
    int idx = 0;
    for(int i = midIdx; i >= 0; i--) {
        if(cur[i] > '0') {
            idx = i;
            break;
        }
    }

    if(idx == 0) {
        solvePowerOf10((cur[0] - '0') * pw[sz - 1]);
        solve(n - (cur[0] - '0') * pw[sz - 1]);
    }
    else if(isPlindrome(cur)) {
        ans.push_back(n);
    }
    else {
        ll toRem = 0;
        for(int i = 0, power = (int) cur.size() - 1; i < idx; i++, power--) {
            toRem += (cur[i] - '0' - (i == idx)) * (pw[power] + pw[i]);
        }
        toRem += (cur[idx] - '0' - 1) * pw[(int) cur.size() - 1 - idx];
        if(sz % 2 == 0 || idx != midIdx) toRem += (cur[idx] - '0' - 1) * pw[idx];
        ans.push_back(toRem);
        solve(n - toRem);
    }
}

// 544242542544

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);


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

    ll n;
    cin >> n;
    solve(n);

    sort(ans.begin(), ans.end());
    vector<ll> res = {ans[0]};
    for(int i = 1; i < (int) ans.size(); i++) {
        if(ans[i] + res.back() < 10) res.back() += ans[i];
        else res.push_back(ans[i]);
    }
    cout << (int) res.size() << '\n';
    for(auto i: res) cout << i << '\n';



    return 0;
}