Problem: In this problem you will write a simple generator of Brainfuck (<https://en.wikipedia.org/wiki/Brainfuck>) calculators.

You are given an arithmetic expression consisting of integers from 0 to 255 and addition/subtraction signs between them. Output a Brainfuck program which, when executed, will print the result of evaluating this expression.

We use a fairly standard Brainfuck interpreter for checking the programs:

  * 30000 memory cells.
  * memory cells store integers from 0 to 255 with unsigned 8-bit wraparound.
  * console input (, command) is not supported, but it's not needed for this problem.

Input

The only line of input data contains the arithmetic expression. The expression will contain between 2 and 10 operands, separated with arithmetic signs plus and/or minus. Each operand will be an integer between 0 and 255, inclusive. The calculations result is guaranteed to be an integer between 0 and 255, inclusive (results of intermediary calculations might be outside of these boundaries).

Output

Output a Brainfuck program which, when executed, will print the result of evaluating this expression. The program must be at most 5000000 characters long (including the non-command characters), and its execution must be complete in at most 50000000 steps.

Examples

Input

2+3


Output

++&gt;
+++&gt;
&lt;[&lt;+&gt;-]&lt;
++++++++++++++++++++++++++++++++++++++++++++++++.


Input

9-7


Output

+++++++++&gt;
+++++++&gt;
&lt;[&lt;-&gt;-]&lt;
++++++++++++++++++++++++++++++++++++++++++++++++.

Note

You can download the source code of the Brainfuck interpreter by the link [http://assets.codeforces.com/rounds/784/bf.cpp](//assets.codeforces.com/rounds/784/bf.cpp). We use this code to interpret outputs.

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
int n;
char data[1010101];
char mode = '+';
int solveMe() {
  int ret = 0;
  int curNum = 0;
  for (int i = 0; i <= n; i++) {
    char cur = data[i];
    if (cur == '!') {
      if (mode == '+')
        ret += curNum;
      else
        ret -= curNum;
      return ret;
    }
    if (cur == '+' || cur == '-') {
      if (mode == '+')
        ret += curNum;
      else
        ret -= curNum;
      mode = cur;
      curNum = 0;
      continue;
    }
    int t = cur - '0';
    curNum = (curNum * 10) + t;
  }
}
void printMe(int val) {
  for (int i = 0; i < 48; i++) printf("+");
  for (int i = 0; i < val; i++) printf("+");
  printf(".>");
  return;
}
int main() {
  scanf("%s", data);
  n = strlen(data);
  data[n] = '!';
  int ans = solveMe();
  if (ans <= 9) {
    printMe(ans);
    return 0;
  }
  if (ans <= 99) {
    printMe(ans / 10);
    printMe(ans % 10);
    return 0;
  }
  printMe(ans / 100);
  ans = ans % 100;
  printMe(ans / 10);
  ans = ans % 10;
  printMe(ans);
  return 0;
}