#include <bits/stdc++.h>
using namespace std;
int MOD = 1e9 + 7;
long long INF = 1e18;
int n, a[105];
int solve() {
  string s;
  cin >> s;
  int ans = 0, x = 0, sign = 1;
  for (int i = 0; i < s.size(); i++) {
    if (s[i] == '+') {
      if (sign)
        ans += x;
      else
        ans -= x;
      sign = 1;
      x = 0;
    } else if (s[i] == '-') {
      if (sign)
        ans += x;
      else
        ans -= x;
      sign = 0;
      x = 0;
    } else {
      int k = s[i] - '0';
      x = x * 10 + k;
    }
  }
  if (sign)
    ans += x;
  else
    ans -= x;
  cerr << ans << endl;
  string out = "";
  if (!ans) {
    for (int i = 0; i < '0'; i++) cout << '+';
    cout << '.' << endl;
    return 0;
  }
  for (; ans; ans /= 10) {
    string tp = "";
    out += '0' + ans % 10;
  }
  reverse(out.begin(), out.end());
  for (int i = 0; i < out[0]; i++) cout << '+';
  cout << '.' << endl;
  for (int j = 1; j < out.size(); j++) {
    int x = out[j] - out[j - 1];
    if (x > 0)
      for (int i = 0; i < x; i++) cout << '+';
    else
      for (int i = 0; i < -x; i++) cout << '-';
    cout << '.' << endl;
  }
  return 0;
}
int main() {
  ios::sync_with_stdio(0);
  solve();
  return 0;
}
