#include <bits/stdc++.h>
using namespace std;
vector<long long> n;
vector<string> inst;
map<vector<long long>, int> m;
long long sa(int p) {
  if ((n[p % 4] % 2) + (n[(p + 1) % 4] % 2) == 0)
    return n[0] + n[1] + n[2] + n[3] - n[p % 4] / 2 - n[(p + 1) % 4] / 2;
  return -1;
}
int main() {
  srand(time(NULL));
  long long in;
  for (int i = 0; i < 4; i++) {
    cin >> in;
    n.push_back(in);
  }
  int t = 0;
  while (n[0] + n[1] + n[2] + n[3] > 4 && t < 1000) {
    long long mn = ((long long)1) << 63 - 1;
    int ip = -1;
    for (int p = 0; p < 4; p++) {
      if (sa(p) != -1 && sa(p) < mn) {
        mn = sa(p);
        ip = p;
      }
    }
    if (ip == -1) {
      ip = rand() % 4;
      n[ip % 4] += 1;
      n[(ip + 1) % 4] += 1;
      inst.push_back("+" + to_string(ip + 1));
    } else {
      n[ip % 4] /= 2;
      n[(ip + 1) % 4] /= 2;
      inst.push_back("/" + to_string(ip + 1));
    }
    t++;
  }
  if (n[0] + n[1] + n[2] + n[3] == 4) {
    for (int i = 0; i < inst.size(); i++) cout << inst[i] << "\n";
  } else {
    cout << "-1\n";
  }
}
