#include <bits/stdc++.h>
using namespace std;
const int dy[] = {-1, 0, 1, 0}, dx[] = {0, 1, 0, -1};
const double EPS = 1e-8;
const double PI = acos(-1.0);
int popcount(int n) { return __builtin_popcount(n); }
int popcount(long long n) { return __builtin_popcountll(n); }
template <class T>
int SIZE(T a) {
  return a.size();
}
template <class T>
string IntToString(T num) {
  string res;
  stringstream ss;
  ss << num;
  return ss.str();
}
template <class T>
T StringToInt(string str) {
  T res = 0;
  for (int i = 0; i < SIZE(str); i++) res = (res * 10 + str[i] - '0');
  return res;
}
template <class T>
T gcd(T a, T b) {
  if (b == 0) return a;
  return gcd(b, a % b);
}
template <class T>
T lcm(T a, T b) {
  return a / gcd(a, b) * b;
}
template <class T>
void PrintSeq(T &a, int sz) {
  for (int i = 0; i < sz; i++) {
    cout << a[i];
    if (sz == i + 1)
      cout << endl;
    else
      cout << ' ';
  }
}
bool EQ(double a, double b) { return abs(a - b) < EPS; }
void fastStream() {
  cin.tie(0);
  std::ios_base::sync_with_stdio(0);
}
vector<string> split(string str, char del) {
  vector<string> res;
  for (int i = 0, s = 0; i < SIZE(str); i++) {
    if (str[i] == del) {
      if (i - s != 0) res.push_back(str.substr(s, i - s));
      s = i + 1;
    } else if (i == SIZE(str) - 1) {
      res.push_back(str.substr(s));
    }
  }
  return res;
}
char str[1000001];
int main() {
  cin >> str;
  int n = strlen(str);
  vector<pair<int, int> > v;
  for (int i = 0; i < n; i++) {
    if (str[i] == '0')
      continue;
    else {
      int head = i;
      int tail = i;
      int zeroCont = 0;
      int one = 0, zero = 0;
      while (1) {
        if (str[tail] == '0')
          zeroCont++, zero++;
        else
          zeroCont = 0, one++;
        if (zeroCont == 2)
          break;
        else if (tail + 1 < n)
          tail++;
        else
          break;
      }
      while (str[tail] == '0') {
        zero--;
        tail--;
      }
      if (one <= 2 + zero) {
        for (int j = head; j <= tail; j++) {
          int pos = n - 1 - j;
          if (str[j] == '1') v.push_back(pair<int, int>(1, pos));
        }
      } else {
        v.push_back(pair<int, int>(1, n - head));
        v.push_back(pair<int, int>(-1, n - tail - 1));
        for (int j = head; j <= tail; j++) {
          int pos = n - 1 - j;
          if (str[j] == '0') v.push_back(pair<int, int>(-1, pos));
        }
      }
      i = tail;
    }
  }
  cout << v.size() << endl;
  for (int i = 0; i < (int)v.size(); i++) {
    if (v[i].first > 0)
      cout << "+";
    else
      cout << "-";
    cout << "2^" << v[i].second << endl;
  }
  return 0;
}
