#include <bits/stdc++.h>
using namespace std;
int marc[10000];
int main() {
    int n; scanf("%d", &n);
    while(marc[n] == 0) {
        printf("%d\n", n);
        marc[n] = 1;
        
        vector<int> digitos;
        while(n > 0) {
            digitos.push_back(n % 10);
            n /= 10;
        }
        while(digitos.size() < 4) digitos.push_back(0);
        
        sort(digitos.begin(), digitos.end());
        
        int x1 = 0;
        for(int i = 0; i < digitos.size(); i++) x1 = (10 * x1) + digitos[i];
        int x2 = 0;
        for(int i = digitos.size() - 1; i >= 0; i--) x2 = (10 * x2) + digitos[i];
        
        n = x2 - x1;
    }
}