Problem: Right now you are to solve a very, very simple problem — to crack the safe. Four positive integers stand one by one on a circle protecting the safe. You know that to unlock this striking safe you have to make all four numbers equal to one. Operations are as follows: you may choose two adjacent numbers and increase both by one; you may choose two adjacent even numbers and divide both by two. Nothing else. Crack the safe!

Input

The single line of the input contains four space-separated integer positive numbers not greater than 109 each — four numbers on the circle in consecutive order.

Output

The output should contain "-1" (quotes for clarity) if the safe is secure, that is it's impossible to crack it. Otherwise, output should contain the sequence of operations (one operations per line) leading to unlocking the safe. You don't have to minimize the number of operations, but it should not exceed 1000. To make things clear, assume numbers stand on positions 1 through 4. Each operation is encoded by two symbols. If the following operation is dividing then first symbol is '/'; otherwise it's '+' (addition). The second symbol is the position of the first number in pair in consecutive order. (see samples for clarification).

If there are several solutions, output any of them.

Examples

Input

1 1 1 1


Output



Input

1 2 4 2


Output

/2
/3


Input

3 3 1 1


Output

+1
/1
/1


Input

2 1 2 4


Output

/3
/4

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
inline long long getint() {
  long long _x = 0, _tmp = 1;
  char _tc = getchar();
  while ((_tc < '0' || _tc > '9') && _tc != '-') _tc = getchar();
  if (_tc == '-') _tc = getchar(), _tmp = -1;
  while (_tc >= '0' && _tc <= '9') _x *= 10, _x += (_tc - '0'), _tc = getchar();
  return _x * _tmp;
}
long long mypow(long long _a, long long _x, long long _mod) {
  if (_x == 0) return 1ll;
  long long _tmp = mypow(_a, _x / 2, _mod);
  _tmp = (_tmp * _tmp) % _mod;
  if (_x & 1) _tmp = (_tmp * _a) % _mod;
  return _tmp;
}
inline long long add(long long _x, long long _y,
                     long long _mod = 1000000007ll) {
  long long _ = _x + _y;
  if (_ >= _mod) _ -= _mod;
  return _;
}
inline long long sub(long long _x, long long _y,
                     long long _mod = 1000000007ll) {
  long long _ = _x - _y;
  if (_ < 0) _ += _mod;
  return _;
}
inline long long mul(long long _x, long long _y,
                     long long _mod = 1000000007ll) {
  long long _ = _x * _y;
  if (_ >= _mod) _ %= _mod;
  return _;
}
inline bool equal(double _x, double _y) {
  return _x > _y - 1e-9 && _x < _y + 1e-9;
}
int __ = 1, _cs;
map<vector<long long>, vector<long long> > M;
queue<vector<long long> > Q;
void build() {
  Q.push({1, 1, 1, 1});
  M[{1, 1, 1, 1}] = {1, 1, 1, 1};
  while (Q.size()) {
    vector<long long> tmp = Q.front();
    Q.pop();
    for (int i = 0; i < 4; i++) {
      vector<long long> tmp2 = tmp;
      tmp2[i]--;
      tmp2[(i + 1) % 4]--;
      if (M.count(tmp2) == 0) {
        M[tmp2] = tmp;
        if (tmp2[i] >= 1 && tmp2[(i + 1) % 4] >= 1) Q.push(tmp2);
      }
    }
    for (int i = 0; i < 4; i++) {
      vector<long long> tmp2 = tmp;
      tmp2[i] *= 2;
      tmp2[(i + 1) % 4] *= 2;
      if (M.count(tmp2) == 0) {
        M[tmp2] = tmp;
        if (tmp2[i] < 11 && tmp2[(i + 1) % 4] < 11) Q.push(tmp2);
      }
    }
  }
}
vector<long long> a;
void init() {
  a.resize(4);
  for (int i = 0; i < 4; i++) a[i] = getint();
}
vector<pair<int, int> > ans;
void build_ans() {
  while (M.count(a) && a != M[a]) {
    bool got = false;
    for (int i = 0; i < 4 && !got; i++) {
      if (M[a][i] * 2 == a[i] && M[a][(i + 1) % 4] * 2 == a[(i + 1) % 4]) {
        got = true;
        ans.push_back(make_pair(0, i + 1));
      }
    }
    for (int i = 0; i < 4 && !got; i++) {
      if (M[a][i] - 1 == a[i] && M[a][(i + 1) % 4] - 1 == a[(i + 1) % 4]) {
        got = true;
        ans.push_back(make_pair(1, i + 1));
      }
    }
    if (!got) {
      puts("-1");
      exit(0);
    }
    a = M[a];
  }
  for (int i = 0; i < 4; i++)
    if (a[i] != 1) {
      puts("-1");
      exit(0);
    }
}
void solve() {
  while (M.count(a) == 0) {
    bool flag = false;
    for (int i = 0; i < 4; i++)
      if (a[i] % 2 == 0) {
        if (a[(i + 1) % 4] % 2 == 0) {
          a[i] /= 2;
          a[(i + 1) % 4] /= 2;
          ans.push_back(make_pair(0, i + 1));
        } else {
          a[(i + 1) % 4]++;
          a[(i + 2) % 4]++;
          ans.push_back(make_pair(1, (i + 1) % 4 + 1));
          a[i] /= 2;
          a[(i + 1) % 4] /= 2;
          ans.push_back(make_pair(0, i + 1));
        }
        flag = true;
      }
    for (int i = 0; i < 4; i++)
      while (a[i] % 2 == 1 && a[(i + 1) % 4] % 2 == 1 &&
             (a[i] > 1 || a[(i + 1) % 4] > 1)) {
        a[i]++;
        a[(i + 1) % 4]++;
        ans.push_back(make_pair(1, i + 1));
        a[i] /= 2;
        a[(i + 1) % 4] /= 2;
        ans.push_back(make_pair(0, i + 1));
        flag = true;
      }
    long long tsum = 0;
    for (int i = 0; i < 4; i++) tsum += a[i];
    if (tsum == 5) {
      for (int i = 0; i < 4; i++)
        if (a[i] == 2) {
          a[(i + 3) % 4]++;
          a[i]++;
          ans.push_back(make_pair(1, (i + 3) % 4 + 1));
          a[i]++;
          a[(i + 1) % 4]++;
          ans.push_back(make_pair(1, i + 1));
          a[(i + 3) % 4] /= 2;
          a[i] /= 2;
          ans.push_back(make_pair(0, (i + 3) % 4 + 1));
          a[i] /= 2;
          a[(i + 1) % 4] /= 2;
          ans.push_back(make_pair(0, i + 1));
          break;
        }
    }
    if (!flag) {
      puts("-1");
      exit(0);
    }
  }
  build_ans();
  for (size_t i = 0; i < ans.size(); i++)
    printf("%c%d\n", "/+"[ans[i].first], ans[i].second);
}
int main() {
  build();
  while (__--) {
    init();
    solve();
  }
}