#include <bits/stdc++.h>
using namespace std;
string s, Ti1, Ti2, Ti3;
long long int hashString[1000005] = {0}, pow33Inv[1000005] = {0}, MOD = 1e9 + 7,
              l1, l2, rem;
long long int fastExpo(long long int base, long long int k, long long int mod) {
  long long int res = 1;
  base %= mod;
  while (k) {
    if (k % 2) res *= base;
    base *= base;
    k /= 2;
    res %= mod;
    base %= mod;
  }
  return res;
}
void preCalculation() {
  long long int t = 1;
  pow33Inv[0] = 1;
  for (int i = 1; i <= 1000000; i++) {
    t *= 10;
    t %= MOD;
    pow33Inv[i] = fastExpo(t, MOD - 2, MOD);
  }
}
void check(long long int length1, long long int length2, long long int length) {
  if (length1 > 0 && length2 > 0 && length1 <= length && length2 <= length) {
    long long int hash3 = hashString[s.size() - length];
    long long int hash1 = ((hashString[0] - hashString[length1] + MOD) % MOD *
                           (pow33Inv[s.size() - length1]) % MOD) %
                          MOD;
    long long int hash2 =
        ((hashString[length1] - hashString[length1 + length2] + MOD) % MOD *
         (pow33Inv[s.size() - (length1 + length2)]) % MOD) %
        MOD;
    if ((hash1 + hash2) % MOD == hash3) {
      Ti1 = s.substr(0, l1);
      Ti2 = s.substr(l1, l2);
      Ti3 = s.substr(l1 + l2, length);
      if ((Ti1[0] != '0' || length1 == 1) && (Ti2[0] != '0' || length2 == 1) &&
          ((Ti3[0] != '0' || length == 1))) {
        cout << Ti1 << '+' << Ti2 << '=' << Ti3 << endl;
        exit(0);
      }
    }
  }
}
int main() {
  ios_base::sync_with_stdio(0);
  cin >> s;
  long long int t = 1;
  preCalculation();
  for (int i = s.size() - 1; i >= 0; i--) {
    hashString[i] = (s[i] - '0') * t + hashString[i + 1];
    hashString[i] %= MOD;
    t *= 10;
    t %= MOD;
  }
  for (int i = 1; i <= s.size(); i++) {
    rem = s.size() - i;
    if (rem / 2 <= i) {
      l1 = i;
      l2 = rem - l1;
      check(l1, l2, i);
      l1 = i - 1;
      l2 = rem - l1;
      check(l1, l2, i);
      l2 = i;
      l1 = rem - l2;
      check(l1, l2, i);
      l2 = i - 1;
      l1 = rem - l2;
      check(l1, l2, i);
    }
  }
  return 0;
}
