Problem: One day Vasya was solving arithmetical problems. He wrote down an expression a + b = c in his notebook. When the teacher checked Vasya's work it turned out that Vasya had solved the problem incorrectly. Now Vasya tries to find excuses. He says that he simply forgot to write down several digits in numbers a, b and c, but he can't remember what numbers they actually were. Help Vasya, find such numbers x, y and z, with which the following conditions are met: 

  * x + y = z, 
  * from the expression x + y = z several digits can be erased in such a way that the result will be a + b = c, 
  * the expression x + y = z should have the minimal length. 

Input

The first and only input line contains the expression a + b = c (1 ≤ a, b, c ≤ 106, a, b and c don't contain leading zeroes) which is the expression Vasya wrote down.

Output

Print the correct expression x + y = z (x, y and z are non-negative numbers without leading zeroes). The expression a + b = c must be met in x + y = z as a subsequence. The printed solution should have the minimal possible number of characters. If there are several such solutions, you can print any of them.

Examples

Input

2+4=5


Output

21+4=25


Input

1+1=3


Output

1+31=32


Input

1+1=2


Output

1+1=2

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
int f[11][11][11][2];
int a[11], b[11], c[11];
struct turn {
  long long a, b, c;
  long long e1, e2, e3;
} g[11][11][11][2];
void get(int x[], int l) {
  int i = 11 - 1;
  do {
    x[i] = l % 10;
    l /= 10;
    i--, x[0]++;
  } while (l);
  x[i] = x[i - 1] = 1000000000;
}
int main() {
  int i, j, k, l;
  int ni, nj, nk, nl, x, y, cost;
  int ans, F;
  turn *G;
  scanf("%d+%d=%d", &i, &j, &k);
  get(a, i);
  get(b, j);
  get(c, k);
  for (i = 0; i <= 1 + a[0]; ++i)
    for (j = 0; j <= 1 + b[0]; ++j)
      for (k = 0; k <= 1 + c[0]; ++k)
        f[i][j][k][0] = f[i][j][k][1] = 1000000000;
  f[0][0][0][0] = 0;
  g[0][0][0][0] = (struct turn){0, 0, 0, 1, 1, 1};
  for (i = 0; i <= 1 + a[0]; ++i)
    for (j = 0; j <= 1 + b[0]; ++j)
      for (k = 0; k <= c[0]; ++k)
        for (l = 0; l <= 1; ++l)
          if (f[i][j][k][l] != 1000000000) {
            if (i == a[0] && f[i + 1][j][k][l] > f[i][j][k][l]) {
              f[i + 1][j][k][l] = f[i][j][k][l];
              g[i + 1][j][k][l] = g[i][j][k][l];
            }
            if (j == b[0] && f[i][j + 1][k][l] > f[i][j][k][l]) {
              f[i][j + 1][k][l] = f[i][j][k][l];
              g[i][j + 1][k][l] = g[i][j][k][l];
            }
            for (x = 0; x <= (i <= a[0] ? 9 : 0); ++x) {
              for (y = 0; y <= (j <= b[0] ? 9 : 0); ++y) {
                ni = i, nj = j, nk = k;
                if (x == a[11 - i - 1] && i <= a[0]) ni++;
                if (y == b[11 - j - 1] && j <= b[0]) nj++;
                if ((x + y + l) % 10 == c[11 - k - 1]) nk++;
                nl = ((x + y + l) >= 10);
                cost = 1 + (i <= a[0]) + (j <= b[0]);
                if (f[ni][nj][nk][nl] > f[i][j][k][l] + cost) {
                  f[ni][nj][nk][nl] = f[i][j][k][l] + cost;
                  G = &g[ni][nj][nk][nl];
                  g[ni][nj][nk][nl] = g[i][j][k][l];
                  G->a += G->e1 * x;
                  G->b += G->e2 * y;
                  G->c += G->e3 * (x + y + l % 10);
                  G->e1 *= 10;
                  G->e2 *= 10;
                  G->e3 *= 10;
                }
              }
            }
          }
  G = &g[a[0] + 1][b[0] + 1][c[0]][0];
  F = f[a[0] + 1][b[0] + 1][c[0]][0];
  printf("%I64d+%I64d=%I64d\n", G->a, G->b, G->a + G->b);
  return 0;
}