#include <bits/stdc++.h>
using namespace std;
int dx[] = {0, 0, -1, 1, -1, -1, 1, 1};
int dy[] = {-1, 1, 0, 0, -1, 1, -1, 1};
string str;
int len, three;
long long int has[2000000], H[2000000];
void pre_has() {
  H[0] = 1;
  for (int i = 1; i < 2000000; i++) H[i] = (H[i - 1] * 10) % 1000000007;
}
bool check(int one, int two) {
  if (one >= 0 && one < two && two < three && str[one + 1] == '0' &&
      one + 1 == two && str[two + 1] != '0') {
    long long int a = has[one] % 1000000007;
    a %= 1000000007;
    a += 1000000007;
    a %= 1000000007;
    long long int b =
        (has[two] - (has[one] * H[two - one]) % 1000000007) % 1000000007;
    b %= 1000000007;
    b += 1000000007;
    b %= 1000000007;
    long long int c =
        (has[three] - (has[two] * H[three - two]) % 1000000007) % 1000000007;
    c %= 1000000007;
    c += 1000000007;
    c %= 1000000007;
    if ((a % 1000000007 + b % 1000000007) % 1000000007 == c % 1000000007) {
      return true;
    }
  }
  if (one >= 0 && one < two && two < three && str[one + 1] != '0' &&
      str[two + 1] != '0') {
    long long int a = has[one] % 1000000007;
    a %= 1000000007;
    a += 1000000007;
    a %= 1000000007;
    long long int b =
        (has[two] - (has[one] * H[two - one]) % 1000000007) % 1000000007;
    b %= 1000000007;
    b += 1000000007;
    b %= 1000000007;
    long long int c =
        (has[three] - (has[two] * H[three - two]) % 1000000007) % 1000000007;
    c %= 1000000007;
    c += 1000000007;
    c %= 1000000007;
    if ((a % 1000000007 + b % 1000000007) % 1000000007 == c % 1000000007) {
      return true;
    }
  }
  return false;
}
void ans(int one, int two) {
  for (int i = 0; i < len; i++) {
    cout << str[i];
    if (i == one)
      cout << "+";
    else if (i == two)
      cout << "=";
  }
  cout << endl;
}
int main() {
  pre_has();
  cin >> str;
  if (str == "000") {
    cout << "0+0=0" << endl;
    return 0;
  }
  len = str.length();
  three = len - 1;
  bool flag = false;
  if (str[0] == '0') flag = true;
  has[0] = str[0] - '0';
  for (int i = 1; i < len; i++)
    has[i] = ((has[i - 1] * 10) + str[i] - '0') % 1000000007;
  for (int i = 0; i <= (len / 2) + 1; i++) {
    int ix = i + 1;
    if (len - 2 * ix <= ix) {
      ix = len - ix;
    } else {
      ix = (len + ix) / 2;
    }
    if (check(i, ix - 2)) {
      ans(i, ix - 2);
      return 0;
    } else if (check(i, ix - 1)) {
      ans(i, ix - 1);
      return 0;
    } else if (check(i, ix)) {
      ans(i, ix);
      return 0;
    }
    if (flag) break;
  }
}
