#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
using namespace std;
const long long N = 1e6 + 36;
const long long M = 1e7 + 36;
const long long INF = 1e18 + 7;
const long long MOD = 1e9 + 7;
const long long MOD1 = 888888901;
const long long MOD2 = 999988901;
const long long X[4] = {1, -1, 0, 0};
const long long Y[4] = {0, 0, 1, -1};
const double long PI = 3.14159265358979323846;
const double long EPS = 1e-13;
mt19937 gen(19937);
const int P = 10;
vector<pair<int, int> > p(N);
struct Hash {
  vector<pair<int, int> > h;
  Hash(const string& s) : h(s.size()) {
    h[0].first = s[0] - '0';
    h[0].second = s[0] - '0';
    for (int i(1); i < s.size(); i++) {
      h[i].first = (h[i - 1].first * (1ll) * P) % MOD1;
      h[i].second = (h[i - 1].second * (1ll) * P) % MOD2;
      h[i].first = (h[i].first * (1ll) + s[i] - '0') % MOD1;
      h[i].second = (h[i].second * (1ll) + s[i] - '0') % MOD2;
    }
  }
  pair<int, int> get(int l, int r) {
    int len = r - l + 1;
    int res1 = h[r].first;
    int res2 = h[r].second;
    if (l > 0) {
      res1 -= (1ll) * h[l - 1].first * p[len].first % MOD1;
      res2 -= (1ll) * h[l - 1].second * p[len].second % MOD2;
    }
    res1 %= MOD1;
    res2 %= MOD2;
    if (res1 < 0) res1 += MOD1;
    if (res2 < 0) res2 += MOD2;
    return {res1, res2};
  }
};
inline void prec() {
  p[0].first = 1;
  p[0].second = 1;
  for (int i(1); i < N; i++) {
    p[i].first = (p[i - 1].first * (1ll * P)) % MOD1;
    p[i].second = (p[i - 1].second * (1ll * P)) % MOD2;
  }
}
string s;
int n;
void die(int l1, int l2, int l3) {
  for (int i = 0; i < l1; i++) cout << s[i];
  cout << "+";
  for (int i = l1; i < l1 + l2; i++) cout << s[i];
  cout << "=";
  for (int i = l1 + l2; i < n; i++) cout << s[i];
  exit(0);
}
signed main() {
  ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
  prec();
  cin >> s;
  Hash h(s);
  n = s.size();
  for (int i = 1; i <= (n / 2); i++) {
    int len3 = i, len1, len2;
    len1 = len3;
    len2 = n - len1 - len3;
    if (len2 > 0 && len2 <= len3) {
      bool f = 1;
      int l1 = len1, l2 = len2, l3 = len3;
      if (s[l1] == '0' && l2 > 1) {
        f = 0;
      }
      auto h1 = h.get(0, l1 - 1);
      auto h2 = h.get(l1, l1 + l2 - 1);
      auto h3 = h.get(l1 + l2, n - 1);
      if (((h1.first + h2.first) % MOD1 != h3.first) ||
          ((h1.second + h2.second) % MOD2 != h3.second)) {
        f = 0;
      }
      if (f) {
        die(l1, l2, l3);
      }
    }
    len1 = len3 - 1;
    len2 = n - len1 - len3;
    if (len2 > 0 && len2 <= len3) {
      bool f = 1;
      int l1 = len1, l2 = len2, l3 = len3;
      if (s[l1] == '0' && l2 > 1) {
        f = 0;
      }
      auto h1 = h.get(0, l1 - 1);
      auto h2 = h.get(l1, l1 + l2 - 1);
      auto h3 = h.get(l1 + l2, n - 1);
      if (((h1.first + h2.first) % MOD1 != h3.first) ||
          ((h1.second + h2.second) % MOD2 != h3.second)) {
        f = 0;
      }
      if (f) {
        die(l1, l2, l3);
      }
    }
    len2 = len3;
    len1 = n - len2 - len3;
    if (len1 > 0 && len1 <= len3) {
      bool f = 1;
      int l1 = len1, l2 = len2, l3 = len3;
      if (s[l1] == '0' && l2 > 1) {
        f = 0;
      }
      auto h1 = h.get(0, l1 - 1);
      auto h2 = h.get(l1, l1 + l2 - 1);
      auto h3 = h.get(l1 + l2, n - 1);
      if (((h1.first + h2.first) % MOD1 != h3.first) ||
          ((h1.second + h2.second) % MOD2 != h3.second)) {
        f = 0;
      }
      if (f) {
        die(l1, l2, l3);
      }
    }
    len2 = len3 - 1;
    len1 = n - len2 - len3;
    if (len1 > 0 && len1 <= len3) {
      bool f = 1;
      int l1 = len1, l2 = len2, l3 = len3;
      if (s[l1] == '0' && l2 > 1) {
        f = 0;
      }
      auto h1 = h.get(0, l1 - 1);
      auto h2 = h.get(l1, l1 + l2 - 1);
      auto h3 = h.get(l1 + l2, n - 1);
      if (((h1.first + h2.first) % MOD1 != h3.first) ||
          ((h1.second + h2.second) % MOD2 != h3.second)) {
        f = 0;
      }
      if (f) {
        die(l1, l2, l3);
      }
    }
  }
  cout << -1 << '\n';
  return 0;
}
