#include <bits/stdc++.h>
using namespace std;
const int N = 1e6 + 10;
const unsigned long long base = 10;
const unsigned long long mod = 1e9 + 7;
unsigned long long f[N], p[N];
char s[N];
int len, idx0, idx1;
char s1[N], s2[N], s3[N];
void Hash(char *s) {
  p[0] = 1;
  for (int i = 1; i <= len; i++) {
    f[i] = (f[i - 1] * base + s[i] - '0') % mod;
    p[i] = p[i - 1] * base % mod;
  }
}
bool check(int la, int lb, int lc) {
  int d = 0;
  int pos0 = la, pos1 = la + lb;
  while (la >= 1 && lb >= 1) {
    int x = s1[la] - '0', y = s2[lb] - '0';
    int s = s3[lc] - '0';
    int sum = x + y + d;
    if (sum >= 10)
      d = 1, sum -= 10;
    else
      d = 0;
    if (sum != s) return 0;
    la--;
    lb--;
    lc--;
  }
  while (la >= 1) {
    int x = s1[la] - '0';
    int s = s3[lc] - '0';
    x += d;
    if (x >= 10)
      d = 1, x -= 10;
    else
      d = 0;
    if (x != s) return 0;
    la--;
    lc--;
  }
  while (lb >= 1) {
    int x = s2[lb] - '0';
    int s = s3[lc] - '0';
    x += d;
    if (x >= 10)
      d = 1, x -= 10;
    else
      d = 0;
    if (x != s) return 0;
    lb--;
    lc--;
  }
  idx0 = pos0;
  idx1 = pos1;
  return 1;
}
bool solve(int la, int lb, int lc) {
  if (la < 1 || lb < 1 || lc < 1) return 0;
  if (la > lc || lb > lc) return 0;
  if (s[la + 1] == '0' && lb != 1) return 0;
  unsigned long long ha, hb, hc;
  ha = f[la] % mod;
  hb = (f[la + lb] - f[la] * p[lb] % mod + mod) % mod;
  hc = (f[len] - f[la + lb] * p[lc] % mod + mod) % mod;
  if ((ha + hb) % mod == hc) {
    idx0 = la;
    idx1 = la + lb;
    return 1;
  }
  return 0;
}
int main() {
  scanf("%s", s + 1);
  len = strlen(s + 1);
  Hash(s);
  for (int i = 1; 2 * i <= len; i++) {
    if (s[len - i + 1] == '0' && i != 1) continue;
    if (solve(i, len - 2 * i, i)) break;
    if (solve(i - 1, len - 2 * i + 1, i)) break;
    if (solve(len - 2 * i, i, i)) break;
    if (solve(len - 2 * i + 1, i - 1, i)) break;
  }
  for (int i = 1; i <= idx0; i++) printf("%c", s[i]);
  printf("+");
  for (int i = idx0 + 1; i <= idx1; i++) printf("%c", s[i]);
  printf("=");
  for (int i = idx1 + 1; i <= len; i++) printf("%c", s[i]);
  printf("\n");
  return 0;
}
