#include <bits/stdc++.h>
using namespace std;
void readi(int &x) {
  int v = 0, f = 1;
  char c = getchar();
  while (!isdigit(c) && c != '-') c = getchar();
  if (c == '-')
    f = -1;
  else
    v = v * 10 + c - '0';
  while (isdigit(c = getchar())) v = v * 10 + c - '0';
  x = v * f;
}
void readll(long long &x) {
  long long v = 0ll, f = 1ll;
  char c = getchar();
  while (!isdigit(c) && c != '-') c = getchar();
  if (c == '-')
    f = -1;
  else
    v = v * 10 + c - '0';
  while (isdigit(c = getchar())) v = v * 10 + c - '0';
  x = v * f;
}
void readc(char &x) {
  char c;
  while ((c = getchar()) == ' ')
    ;
  x = c;
}
void writes(string s) { puts(s.c_str()); }
void writeln() { writes(""); }
void writei(int x) {
  if (!x) putchar('0');
  char a[25];
  int top = 0;
  while (x) {
    a[++top] = (x % 10) + '0';
    x /= 10;
  }
  while (top) {
    putchar(a[top]);
    top--;
  }
}
void writell(long long x) {
  if (!x) putchar('0');
  char a[25];
  int top = 0;
  while (x) {
    a[++top] = (x % 10) + '0';
    x /= 10;
  }
  while (top) {
    putchar(a[top]);
    top--;
  }
}
inline long long inc(int &x) { return ++x; }
inline long long inc(long long &x) { return ++x; }
inline long long inc(int &x, long long y) { return x += y; }
inline long long inc(long long &x, long long y) { return x += y; }
inline double inc(double &x, double y) { return x += y; }
inline long long dec(int &x) { return --x; }
inline long long dec(long long &x) { return --x; }
inline long long dec(int &x, long long y) { return x -= y; }
inline long long dec(long long &x, long long y) { return x -= y; }
inline double dec(double &x, double y) { return x -= y; }
inline long long mul(int &x) { return x = ((long long)x) * x; }
inline long long mul(long long &x) { return x = x * x; }
inline long long mul(int &x, long long y) { return x *= y; }
inline long long mul(long long &x, long long y) { return x *= y; }
inline double mul(double &x, double y) { return x *= y; }
inline long long divi(int &x) { return x = sqrt(x); }
inline long long divi(long long &x) { return x = sqrt(x); }
inline long long divi(int &x, long long y) { return x /= y; }
inline long long divi(long long &x, long long y) { return x /= y; }
inline double divi(double &x, double y) { return x /= y; }
inline long long mod(int &x, long long y) { return x %= y; }
inline long long mod(long long &x, long long y) { return x %= y; }
long long n, m, i, j, ans = 0x1bbbbbbbbbbbbbbbll, sa, sb, sc, a, b, c, p[20];
void dfs(long long x, long long y, long long z, long long g, long long sx,
         long long sy, long long ss, long long now) {
  if (ss >= ans) return;
  if (x == 0 && y == 0 && z == 0 && g == 0) {
    ans = ss;
    sa = sx;
    sb = sy;
    sc = sx + sy;
    return;
  }
  if (z == 0) {
    dfs(x / 10, y / 10, z, (x % 10 + y % 10 + g) / 10, sx + p[now] * (x % 10),
        sy + p[now] * (y % 10), ss + 1, now + 1);
    return;
  }
  if ((x % 10 + y % 10 + g) % 10 == z % 10) {
    dfs(x / 10, y / 10, z / 10, (x % 10 + y % 10 + g) / 10,
        sx + p[now] * (x % 10), sy + p[now] * (y % 10), ss, now + 1);
    return;
  }
  dfs(x * 10 + (z % 10 - y % 10 - g + p[15]) % 10, y, z, g, sx, sy, ss + 1,
      now);
  dfs(x, y * 10 + (z % 10 - x % 10 - g + p[15]) % 10, z, g, sx, sy, ss + 1,
      now);
  dfs(x, y, z * 10 + (y % 10 + x % 10 + g) % 10, g, sx, sy, ss + 1, now);
}
int main() {
  p[0] = 1;
  if ((1) <= ((18)))
    for (((i)) = (1); ((i)) <= ((18)); ((i))++) p[i] = p[i - 1] * 10ll;
  scanf("%I64d+%I64d=%I64d", &a, &b, &c);
  dfs(a, b, c, 0, 0, 0, 0, 0);
  printf("%I64d+%I64d=%I64d\n", sa, sb, sc);
  return 0;
}
