#include <bits/stdc++.h>
using namespace std;
long long p[14], ans = 14, pa, pb;
void dfs(long long a, long long b, long long c, long long ra, long long rb,
         long long op, long long num, long long d) {
  if (num >= ans) return;
  if (!a && !b && !c && !op) {
    ans = num;
    pa = ra;
    pb = rb;
    return;
  }
  if (!c) {
    long long s = a + b + op, k = 0;
    while (s) s /= 10, k++;
    dfs(0, 0, 0, ra + a * p[d], rb + b * p[d], 0, num + k, d);
  } else if ((a + b + op) % 10 == c % 10)
    dfs(a / 10, b / 10, c / 10, ra + p[d] * (a % 10), rb + p[d] * (b % 10),
        (op + a % 10 + b % 10) / 10, num, d + 1);
  else {
    dfs(a * 10 + (c - b % 10 - op + 10) % 10, b, c, ra, rb, op, num + 1, d);
    dfs(a, b * 10 + (c - a % 10 - op + 10) % 10, c, ra, rb, op, num + 1, d);
    dfs(a, b, c * 10 + (a + b + op) % 10, ra, rb, op, num + 1, d);
  }
}
int main() {
  long long a, b, c;
  scanf("%I64d+%I64d=%I64d", &a, &b, &c);
  p[0] = 1;
  for (long long i = 1; i <= 13; i++) p[i] = p[i - 1] * 10;
  dfs(a, b, c, 0, 0, 0, 0, 0);
  printf("%I64d+%I64d=%I64d", pa, pb, pa + pb);
}
