#include <bits/stdc++.h>
using namespace std;
int a[10];
int m, x[1050], y[1050];
bool judge() {
  for (int i = 0; i < 4; i++)
    if (a[i] ^ 1) return false;
  return true;
}
int next(int idx) { return (idx + 1) % 4; }
void solve() {
  int idx, q;
  m = 0;
  while (!judge()) {
    idx = -1;
    for (int i = 0; i < 4; i++) {
      q = next(i);
      if (a[i] % 2 == a[q] % 2) {
        if (a[i] % 2 == 0) {
          idx = i;
          break;
        } else if (a[i] != 1 || a[q] != 1) {
          idx = i;
          break;
        }
      }
    }
    if (idx != -1) {
      y[m] = idx;
      if (a[idx] % 2) {
        x[m] = 0;
        a[idx]++;
        a[next(idx)]++;
      } else {
        a[idx] /= 2;
        a[next(idx)] /= 2;
        x[m] = 1;
      }
      m++;
      continue;
    }
    for (int i = 0; i < 4; i++)
      if (a[i] % 2 && a[next(i)] % 2 == 0) {
        if (idx == -1 || a[i] > a[idx]) idx = i;
      }
    a[idx]++;
    a[next(idx)]++;
    y[m] = idx;
    x[m] = 0;
    m++;
    if (m > 1000) {
      puts("-1");
      return;
    }
  }
  for (int i = 0; i < m; i++) {
    if (x[i])
      putchar('/');
    else
      putchar('+');
    printf("%d\n", y[i] + 1);
  }
}
int main() {
  for (int i = 0; i < 4; i++) scanf("%d", a + i);
  solve();
  return 0;
}
