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;
template <typename TA, typename TB>
ostream &operator<<(ostream &ostm, const pair<TA, TB> &p) {
  ostm << "(" << p.first << "," << p.second << ")";
  return ostm;
}
template <typename T>
ostream &operator<<(ostream &ostm, const vector<T> &v) {
  ostm << "[ ";
  for (auto i : v) ostm << i << " ";
  ostm << "]";
  return ostm;
}
template <typename TA, typename TB>
ostream &operator<<(ostream &ostm, const map<TA, TB> &mp) {
  ostm << "[ ";
  for (auto &it : mp) ostm << it << " ";
  ostm << "]";
  return ostm;
}
template <typename T>
ostream &operator<<(ostream &ostm, const set<T> &s) {
  ostm << "[ ";
  for (auto &it : s) ostm << it << " ";
  ostm << "]";
  return ostm;
}
template <typename T>
ostream &operator<<(ostream &ostm, const stack<T> &inp) {
  stack<T> st = inp;
  ostm << "[ ";
  while (!st.empty()) {
    ostm << st.top() << " ";
    st.pop();
  }
  ostm << "]";
  return ostm;
}
template <typename T>
ostream &operator<<(ostream &ostm, const queue<T> &inp) {
  queue<T> q = inp;
  ostm << "[ ";
  while (!q.empty()) {
    ostm << q.front() << " ";
    q.pop();
  }
  ostm << "]";
  return ostm;
}
template <typename T>
ostream &operator<<(ostream &ostm, const priority_queue<T> &inp) {
  priority_queue<T> pq = inp;
  ostm << "[ ";
  while (!pq.empty()) {
    ostm << pq.top() << " ";
    pq.pop();
  }
  ostm << "]";
  return ostm;
}
template <typename T>
ostream &operator<<(ostream &ostm, const deque<T> &inp) {
  deque<T> dq = inp;
  ostm << "[ ";
  while (!dq.empty()) {
    ostm << dq.front() << " ";
    dq.pop_front();
  }
  ostm << "]";
  return ostm;
}
inline int gtx() {
  const int N = 1048576;
  static char __buffer[N];
  static char *__p = __buffer, *__end = __buffer;
  if (__p == __end) {
    if ((__end = __buffer + fread(__buffer, 1, N, stdin)) == __buffer)
      return EOF;
    __p = __buffer;
  }
  return *__p++;
}
template <typename T>
inline bool rit(T &x) {
  char c = 0;
  bool fg = 0;
  while (c = gtx(), (c < '0' && c != '-') || c > '9')
    if (c == EOF) return false;
  c == '-' ? (fg = 1, x = 0) : (x = c - '0');
  while (c = gtx(), c >= '0' && c <= '9') x = x * 10 + c - '0';
  if (fg) x = -x;
  return true;
}
template <typename T, typename... Args>
inline bool rit(T &x, Args &...args) {
  return rit(x) && rit(args...);
}
inline void pit(int x) { printf("%d", x); }
inline void pln(long long x) { printf("%I64d", x); }
template <typename... Args>
inline void pit(int x, Args... args) {
  printf("%d ", x);
  pit(args...);
}
template <typename... Args>
inline void pln(long long x, Args... args) {
  printf("%I64d ", x);
  pit(args...);
}
void JIZZ() {
  cout << "";
  exit(0);
}
const long double PI = 3.14159265358979323846264338327950288;
const long double eps = 1e-8;
const long long mod = 1e9 + 7;
int main() {
  int val = 0, t = 0;
  char c, add = 1;
  while (c = gtx()) {
    if (c >= '0' && c <= '9')
      t = t * 10 + c - '0';
    else if (c == '+') {
      if (add)
        val += t;
      else
        val -= t;
      t = 0;
      add = 1;
    } else if (c == '-') {
      if (add)
        val += t;
      else
        val -= t;
      t = 0;
      add = 0;
    } else
      break;
  }
  if (add)
    val += t;
  else
    val -= t;
  stack<int> st;
  if (val == 0) st.push(0);
  while (val) {
    st.push(val % 10);
    val /= 10;
  }
  while (st.size()) {
    printf("++++++++++++++++++++++++++++++++++++++++++++++++");
    for (int i = 0; i < st.top(); ++i) putchar('+');
    putchar('.'), putchar('>');
    puts("");
    st.pop();
  }
}