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;
string s;
vector<int> digits;
int main() {
  int i, ans = 0, cur = 0;
  bool g = false;
  cin >> s;
  for (i = 0; i < s.length(); i++) {
    if (s[i] == '+' || s[i] == '-') {
      if (g)
        ans -= cur;
      else
        ans += cur;
      cur = 0;
      if (s[i] == '+')
        g = false;
      else
        g = true;
    } else {
      cur *= 10;
      cur += s[i] - '0';
    }
  }
  if (g)
    ans -= cur;
  else
    ans += cur;
  if (ans == 0) digits.push_back(0);
  while (ans != 0) {
    digits.push_back(ans % 10);
    ans /= 10;
  }
  int j = 0;
  for (i = digits.size() - 1; i >= 0; i--) {
    while (j != digits[i] + '0') {
      if (digits[i] + '0' < j) {
        j--;
        cout << '-';
      } else {
        j++;
        cout << '+';
      }
    }
    cout << '.' << endl;
  }
  return 0;
}