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

# MC521 - Desafios de Programacao I - 1s2021
# Contest: 23/04/2021
# Problema H - Quasi Binary

# le o numero inteiro a ser analisado
n = int(input())

# inializa variavel auxilair
num = [0] * 7

# separa a ordem dos numeros
for i in range(7):
  num[i] = n//(10**(6-i))
  n = n%(10**(6-i))

# destrincha o numero
while(num.count(0) < 7):
  res = 0
  if(num[0] > 0):
    res += 1000000
    num[0] -= 1
  
  if(num[1] > 0):
    res += 100000
    num[1] -= 1
  
  if(num[2] > 0):
    res += 10000
    num[2] -= 1

  if(num[3] > 0):
    res += 1000
    num[3] -= 1

  if(num[4] > 0):
    res += 100
    num[4] -= 1

  if(num[5] > 0):
    res += 10
    num[5] -= 1

  if(num[6] > 0):
    res += 1
    num[6] -= 1
  
  # imprime o restultado
  print(res, end=" ")
print()
			 				  		 			 						 	