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;
char s[100005];
int main() {
  scanf("%s", s);
  int len;
  for (len = 0; s[len]; len++)
    ;
  s[len] = '+';
  int cur = 0;
  int ptr;
  for (ptr = 0; s[ptr] >= '0' && s[ptr] <= '9'; ptr++)
    cur *= 10, cur += s[ptr] - '0';
  char sign = s[ptr];
  int res = cur;
  cur = 0;
  for (ptr = ptr + 1; s[ptr]; ptr++) {
    if (s[ptr] < '0' || s[ptr] > '9') {
      if (sign == '+') {
        res += cur;
      } else {
        res -= cur;
      }
      sign = s[ptr];
      cur = 0;
    } else
      cur *= 10, cur += s[ptr] - '0';
  }
  if (res == 0) {
    printf("++++++++++++++++++++++++++++++++++++++++++++++++.>\n");
    return 0;
  }
  stack<int> s;
  while (res) {
    s.push(res % 10);
    res /= 10;
  }
  while (!s.empty()) {
    for (int i = 0; i < s.top(); i++) printf("+");
    printf("\n");
    printf("++++++++++++++++++++++++++++++++++++++++++++++++.>\n");
    s.pop();
  }
  return 0;
}