#include <bits/stdc++.h>
using namespace std;
const int inf = 1e9 + 7;
template <class T>
void dbs(string str, T t) {
  cout << str << " : " << t << endl;
}
template <class T, class... second>
void dbs(string str, T t, second... s) {
  int idx = str.find(',');
  cout << str.substr(0, idx) << " : " << t << ",";
  dbs(str.substr(idx + 1), s...);
}
template <class second, class T>
ostream& operator<<(ostream& os, const pair<second, T>& p) {
  return os << "(" << p.first << ", " << p.second << ")";
}
template <class T>
ostream& operator<<(ostream& os, const vector<T>& p) {
  os << "[ ";
  for (auto& it : p) os << it << " ";
  return os << "]";
}
template <class T>
ostream& operator<<(ostream& os, const set<T>& p) {
  os << "[ ";
  for (auto& it : p) os << it << " ";
  return os << "]";
}
template <class second, class T>
ostream& operator<<(ostream& os, const map<second, T>& p) {
  os << "[ ";
  for (auto& it : p) os << it << " ";
  return os << "]";
}
template <class T>
void prc(T a, T b) {
  cout << "[";
  for (T i = a; i != b; ++i) {
    if (i != a) cout << ", ";
    cout << *i;
  }
  cout << "]";
  cout << endl;
}
bool isPrime(int x) {
  for (int i = 2; i * i <= x; i++)
    if (x % i == 0) return false;
  return true;
}
const int K = 1;
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  string s;
  cin >> s;
  int n = s.length();
  vector<int> primes;
  for (int i = inf; int(primes.size()) < K; --i) {
    if (isPrime(i)) primes.push_back(i);
  }
  vector<vector<int> > p(K, vector<int>(n));
  vector<vector<int> > sum(K, vector<int>(n));
  for (int i = (0); i <= (K - 1); ++i) {
    int pr = primes[i];
    p[i][0] = 1, p[i][1] = 10;
    for (int j = (2); j <= (n - 1); ++j) {
      p[i][j] = (p[i][j - 1] * 10LL) % pr;
    }
    sum[i][0] = s[0] - '0';
    for (int j = (1); j <= (n - 1); ++j) {
      sum[i][j] = (sum[i][j - 1] * 10LL + (s[j] - '0')) % pr;
    }
  }
  auto get = [&](int l, int r) {
    vector<int> ans(K);
    for (int i = (0); i <= (K - 1); ++i) {
      int pr = primes[i];
      if (l == 0) {
        ans[i] = sum[i][r];
      } else {
        ans[i] =
            (sum[i][r] + (pr - (sum[i][l - 1] * 1LL * p[i][r - l + 1]) % pr)) %
            pr;
      }
    }
    return ans;
  };
  auto add = [&](vector<int> x, const vector<int>& y) -> vector<int> {
    for (int i = (0); i <= (K - 1); ++i) {
      x[i] = (x[i] + y[i]) % primes[i];
    }
    return x;
  };
  for (int i = (0); i <= (n - 1); ++i) {
    int len = n - i;
    for (int x : {len, len - 1})
      if (x > 0) {
        int y = n - len - x;
        if (y > 0 and y <= x and (s[n - len] != '0' or len == 1)) {
          if ((s[0] != '0' or x == 1) and (s[x] != '0' or y == 1) and
              add(get(0, x - 1), get(x, x + y - 1)) == get(x + y, n - 1)) {
            return cout << s.substr(0, x) << "+" << s.substr(x, y) << "="
                        << s.substr(x + y),
                   0;
          }
          swap(x, y);
          if (s[x] != '0' and
              add(get(0, x - 1), get(x, x + y - 1)) == get(x + y, n - 1)) {
            return cout << s.substr(0, x) << "+" << s.substr(x, y) << "="
                        << s.substr(x + y),
                   0;
          }
          swap(x, y);
        }
      }
  }
  return 0;
}
