#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
template <typename T, typename TT>
inline ostream &operator<<(ostream &os, const pair<T, TT> &t) {
  return os << t.first << " " << t.second;
}
template <typename T>
inline ostream &operator<<(ostream &os, const vector<T> &t) {
  for (auto i : t) os << i << " ";
  return os;
}
template <typename T>
inline istream &operator>>(istream &is, vector<T> &v) {
  for (T &t : v) is >> t;
  return is;
}
template <typename T1, typename T2>
inline istream &operator>>(istream &is, pair<T1, T2> &t) {
  is >> t.first >> t.second;
  return is;
}
const long long mod = 1e9 + 7;
void solve() {
  string s;
  cin >> s;
  vector<string> ans;
  reverse(s.begin(), s.end());
  s += "0000";
  int i = 0;
  while (i < s.size()) {
    if (s[i] == '0') {
      i++;
      continue;
    }
    if (s[i + 1] == '0') {
      ans.push_back("+2^" + to_string(i));
      i += 2;
      continue;
    }
    int j = i;
    while (s[j] == '1') j++;
    ans.push_back("-2^" + to_string(i));
    i = j;
    s[i] = '1';
  }
  cout << ans.size() << '\n';
  for (auto x : ans) cout << x << '\n';
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr);
  ;
  int T = 1;
  while (T--) {
    solve();
  }
  return 0;
}
