#include <bits/stdc++.h>
using namespace std;
int f[1000010][2];
int g[1000010][2];
char s[1000010];
int n;
int main() {
  scanf("%s", s + 1);
  n = strlen(s + 1);
  f[0][0] = 0;
  f[0][1] = 1;
  for (int i = 0; i < n; i++) {
    f[i + 1][0] = f[i + 1][1] = 1000000000;
    if (f[i][0] + s[i + 1] - '0' < f[i + 1][0]) {
      f[i + 1][0] = f[i][0] + s[i + 1] - '0';
      g[i + 1][0] = 0;
    }
    if (f[i][1] + 2 - (s[i + 1] - '0') < f[i + 1][0]) {
      f[i + 1][0] = f[i][1] + 2 - (s[i + 1] - '0');
      g[i + 1][0] = 1;
    }
    if (f[i][0] + 1 + (s[i + 1] - '0') < f[i + 1][1]) {
      f[i + 1][1] = f[i][0] + 1 + (s[i + 1] - '0');
      g[i + 1][1] = 0;
    }
    if (f[i][1] + 1 - (s[i + 1] - '0') < f[i + 1][1]) {
      f[i + 1][1] = f[i][1] + 1 - (s[i + 1] - '0');
      g[i + 1][1] = 1;
    }
  }
  printf("%d\n", f[n][0]);
  for (int i = n, j = 0; i >= 0; i--) {
    int k = g[i][j];
    if (i == 0) {
      if (j) printf("+2^%d\n", n);
      continue;
    }
    if (k == 0 && j == 0) {
      if (s[i] == '1') printf("+2^%d\n", n - i);
    }
    if (k == 1 && j == 0) {
      if (s[i] == '1')
        printf("-2^%d\n", n - i);
      else
        printf("-2^%d\n-2^%d\n", n - i, n - i);
    }
    if (k == 0 && j == 1) {
      printf("+2^%d\n", n - i);
      if (s[i] == '1') printf("+2^%d\n", n - i);
    }
    if (k == 1 && j == 1) {
      if (s[i] == '0') printf("-2^%d\n", n - i);
    }
    j = k;
  }
  return 0;
}
