#include <bits/stdc++.h>
using namespace std;
const int NMAX = 1000010;
size_t N;
char s[NMAX];
int d[NMAX];
int size[NMAX];
int dp[NMAX][2];
int go(int i, int x) {
  if (i == N) {
    if (x == 1) printf("-2^0\n");
    return 0;
  }
  int pos = 0;
  if (d[i] == x) {
    pos = go(i + 1, x);
  } else {
    char sign = (x == 0 ? '+' : '-');
    if (dp[i][x] == size[i] + dp[i + 1][x]) {
      pos = go(i + 1, x);
      for (int j = 0; j < size[i]; ++j) {
        printf("%c2^%d\n", sign, j + pos);
      }
    } else {
      pos = go(i + 1, 1 - x);
      printf("%c2^%d\n", sign, pos + size[i]);
    }
  }
  return pos + size[i];
}
int main() {
  scanf("%s", s);
  N = 0;
  int last = 0;
  for (int i = 1; s[i - 1] == '0' || s[i - 1] == '1'; ++i) {
    if (s[i] != s[last]) {
      d[N] = (s[last] - '0');
      size[N] = i - last;
      N++;
      last = i;
    }
  }
  dp[N][0] = 0;
  dp[N][1] = 1;
  for (int i = N - 1; i >= 0; --i) {
    for (int x = 0; x < 2; ++x) {
      if (d[i] == x)
        dp[i][x] = dp[i + 1][x];
      else
        dp[i][x] = min(size[i] + dp[i + 1][x], 1 + dp[i + 1][1 - x]);
    }
  }
  printf("%d\n", dp[0][0]);
  go(0, 0);
  return 0;
}
