#include <bits/stdc++.h>
using namespace std;
long long ans, a, b, c, ansa, ansb, pw[100], i;
void dfs(long long a, long long b, long long c, long long f, long long ret,
         long long w, long long reta, long long retb) {
  if (ret >= ans) {
    return;
  }
  if (a == 0 && b == 0 && c == 0 && f == 0) {
    ans = ret;
    ansa = reta, ansb = retb;
    return;
  }
  if (c == 0) {
    long long tmp = a + b + f, num = 0;
    while (tmp) num++, tmp /= 10;
    dfs(0, 0, 0, 0, ret + num, w, reta + a * pw[w], retb + b * pw[w]);
    return;
  }
  long long o = a % 10, p = b % 10, q = c % 10;
  if ((o + p + f) % 10 == q)
    dfs(a / 10, b / 10, c / 10, (o + p + f) / 10, ret, w + 1, reta + o * pw[w],
        retb + p * pw[w]);
  else {
    dfs(a * 10 + (20 + q - p - f) % 10, b, c, f, ret + 1, w, reta, retb);
    dfs(a, b * 10 + (20 + q - o - f) % 10, c, f, ret + 1, w, reta, retb);
    dfs(a, b, c * 10 + (o + p + f) % 10, f, ret + 1, w, reta, retb);
  }
}
int main() {
  scanf("%I64d+%I64d=%I64d", &a, &b, &c);
  pw[0] = 1;
  for (i = 1; i <= 18; i++) pw[i] = pw[i - 1] * 10;
  ans = 14;
  dfs(a, b, c, 0, 0, 0, 0, 0);
  printf("%I64d+%I64d=%I64d\n", ansa, ansb, ansa + ansb);
}
