111111
 100009
 10011
 1000000
 8
 10201
 102030
 908172
 123456
 415
 900000
 21
 909090
 314159
 999999
 909823
 987654
 1453
 1435
 98
 10
 2
 1

1
111111
 9
100001 1 1 1 1 1 1 1 1
 1
10011
 1
1000000
 8
1 1 1 1 1 1 1 1
 2
10101 100
 3
101010 1010 10
 9
101111 101011 101010 101010 101010 101010 101010 101000 100000
 6
111111 11111 1111 111 11 1
 5
111 101 101 101 1
 9
100000 100000 100000 100000 100000 100000 100000 100000 100000
 2
11 10
 9
101010 101010 101010 101010 101010 101010 101010 101010 101010
 9
111111 101011 101011 1011 11 1 1 1 1
 9
111111 111111 111111 111111 111111 111111 111111 111111 111111
 9
101111 101111 101101 101100 101100 101100 101100 101100 101000
 9
111111 111111 111111 111111 111110 111100 111000 110000 100000
 5
1111 111 111 110 10
 5
1111 111 111 101 1
 9
11 11 11 11 11 11 11 11 10
 1
10
 2
1 1
 1
1

import java.util.ArrayList;
import java.util.List;
import java.util.Scanner;

public class Main {
  public static void main(String[] args) {
    Scanner sc = new Scanner(System.in);
    int N = sc.nextInt();
    List<Integer> ans = solve(N);
    System.out.println(ans);
    sc.close();
  }

  private static List<Integer> solve(int n) {
    List<Integer> allowed = findN(n);
    int[] dp = new int[n + 1];
    for (int i = 0; i < allowed.size(); i++) {
      dp[allowed.get(i)] = 1;
    }
    int[] prev = new int[n + 1];
    //    for (Integer inn : allowed) {
    //      for (Integer in : allowed) {
    //        dp[inn] = 1;
    //        for (int i = in; (i + inn) <= n; i++) {
    //          if (dp[inn] + 1 < dp[in + inn]) {
    //            dp[in + inn] = dp[inn] + 1;
    //            prev[in + inn] = inn;
    //          }
    //        }
    //      }
    //    }

    dp[0] = 1;
    for (Integer integer : allowed) {
      dp[integer] = 1;
      for (int j = 1; j <= n; j++) {
        if (j + integer <= n) {
          if (dp[j + integer] > dp[j] + 1 || dp[j + integer] == 0) {
            dp[j + integer] = dp[j] + 1;
            prev[j + integer] = j;
          }
        }
        //        j = j + integer;
      }
    }

    List<Integer> ans = new ArrayList<>();
    while (prev[n] != 0) {
      ans.add(n - prev[n]);
      n = prev[n];
    }
    ans.add(n);
    return ans;
  }

  private static List<Integer> findN(int n) {
    int len = String.valueOf(n).length();
    List<Integer> ans = new ArrayList<>();
    int i = 1;
    while (true) {
      String s = Integer.toBinaryString(i);
      if (s.length() <= len) {
        ans.add(Integer.parseInt(s));
        i++;
      } else {
        break;
      }
    }
    return ans;
  }
}
