def bf(str, m):
 n, outp, r = 0, '+' * m + '[', []
 for c in str:
  outp += '>'
  outp += '+' * (ord(c) / m)
  n+=1
  r.append( ord(c) % m )
 outp += '<' * n + '-]'

 for x in r:
  outp += '>' + '+'*x + '.'
 return outp
 
if __name__ == "__main__":
 str = "S dniem programmista xDDDDDD" 
 min, m = len(bf(str, 2)), 2
 for x in range(3, 32):
  l = len(bf(str, x))
  if l < min: min, m = l, x
 print bf(str, m)