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 sys
# sys.stdin = open('b.in', 'rb')

def generateQuasi():
  for i in xrange(2 ** 8):
    yield int(bin(i)[2:])

quasiNumbers = list(generateQuasi())
quasiNumbers.reverse()

class QuasiNumbers():
  def __init__(self, ivar):
    self.ivar = ivar

  @property
  def startingQuasi(self):
    for i, q in enumerate(quasiNumbers):
      if q <= self.ivar:
        return i

  def detQuasi(self, index):
    ivar = self.ivar
    for qn in quasiNumbers[index:]:
      for i in xrange(30):
        if qn > ivar:
          break
        else:
          yield qn
          ivar -= qn
      if ivar == 0:
        break

def main():
  var = raw_input()
  ivar = int(var)
  qn = QuasiNumbers(ivar)
  ans = [list(qn.detQuasi(sq)) for sq in xrange(qn.startingQuasi, 256)]
  final_ans = sorted(ans, key=len)[0]
  print len(final_ans)
  assert sum(final_ans) == ivar
  print " ".join(map(str, final_ans))

if __name__ == '__main__':
  main()