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>
using namespace std;
long long dp[21][21][21][2];
string sa[21][21][21][2];
string sb[21][21][21][2];
long long base[19];
string numa[21], numb[21], numc[21];
string a, b, c;
long long digits(long long num) {
  long long ans = 1;
  while (num /= 10) ans++;
  return ans;
}
void top_down(long long i, long long j, long long k, bool l) {
  if (!i && !j && !k && !l) return;
  long long imin1 = i - 1, jmin1 = j - 1, kmin1 = k - 1;
  if (imin1 < 0) imin1 = 0;
  if (jmin1 < 0) jmin1 = 0;
  if (kmin1 < 0) kmin1 = 0;
  bool addi;
  if (!k)
    addi = true;
  else
    addi = false;
  if (a[i] - '0' + b[j] - '0' + l == c[k] - '0') {
    if (dp[i][j][k][l] < dp[imin1][jmin1][kmin1][0]) {
      dp[imin1][jmin1][kmin1][0] = dp[i][j][k][l] + addi;
      sa[imin1][jmin1][kmin1][0] = a[i] + sa[i][j][k][l];
      sb[imin1][jmin1][kmin1][0] = b[j] + sb[i][j][k][l];
      top_down(imin1, jmin1, kmin1, 0);
    }
  } else if (a[i] - '0' + b[j] - '0' + l == c[k] - '0' + 10) {
    if (dp[i][j][k][l] < dp[imin1][jmin1][kmin1][1]) {
      dp[imin1][jmin1][kmin1][1] = dp[i][j][k][l] + addi;
      sa[imin1][jmin1][kmin1][1] = a[i] + sa[i][j][k][l];
      sb[imin1][jmin1][kmin1][1] = b[j] + sb[i][j][k][l];
      top_down(imin1, jmin1, kmin1, 1);
    }
  } else {
    long long d = (c[k] - b[j] - l + 10) % 10;
    if (d + b[j] - '0' + l == c[k] - '0') {
      if (dp[i][j][k][l] + 1 < dp[i][jmin1][kmin1][0]) {
        dp[i][jmin1][kmin1][0] = dp[i][j][k][l] + 1 + addi;
        sa[i][jmin1][kmin1][0] = char(d + '0') + sa[i][j][k][l];
        sb[i][jmin1][kmin1][0] = b[j] + sb[i][j][k][l];
        top_down(i, jmin1, kmin1, 0);
      }
    } else if (d + b[j] - '0' + l == c[k] - '0' + 10) {
      if (dp[i][j][k][l] + 1 < dp[i][jmin1][kmin1][1]) {
        dp[i][jmin1][kmin1][1] = dp[i][j][k][l] + 1 + addi;
        sa[i][jmin1][kmin1][1] = char(d + '0') + sa[i][j][k][l];
        sb[i][jmin1][kmin1][1] = b[j] + sb[i][j][k][l];
        top_down(i, jmin1, kmin1, 1);
      }
    }
    d = (c[k] - a[i] - l + 10) % 10;
    if (a[i] - '0' + d + l == c[k] - '0') {
      if (dp[i][j][k][l] + 1 < dp[imin1][j][kmin1][0]) {
        dp[imin1][j][kmin1][0] = dp[i][j][k][l] + 1 + addi;
        sa[imin1][j][kmin1][0] = a[i] + sa[i][j][k][l];
        sb[imin1][j][kmin1][0] = char(d + '0') + sb[i][j][k][l];
        top_down(imin1, j, kmin1, 0);
      }
    } else if (a[i] - '0' + d + l == c[k] - '0' + 10) {
      if (dp[i][j][k][l] + 1 < dp[imin1][j][kmin1][1]) {
        dp[imin1][j][kmin1][1] = dp[i][j][k][l] + 1 + addi;
        sa[imin1][j][kmin1][1] = a[i] + sa[i][j][k][l];
        sb[imin1][j][kmin1][1] = char(d + '0') + sb[i][j][k][l];
        top_down(imin1, j, kmin1, 1);
      }
    }
    d = (a[i] - '0' + b[j] - '0' + l + 10) % 10;
    if (a[i] - '0' + b[j] - '0' + l == d) {
      if (dp[i][j][k][l] + 1 < dp[imin1][jmin1][k][0]) {
        dp[imin1][jmin1][k][0] = dp[i][j][k][l] + 1;
        sa[imin1][jmin1][k][0] = a[i] + sa[i][j][k][l];
        sb[imin1][jmin1][k][0] = b[j] + sb[i][j][k][l];
        top_down(imin1, jmin1, k, 0);
      }
    } else if (a[i] - '0' + b[j] - '0' + l == d + 10) {
      if (dp[i][j][k][l] + 1 < dp[imin1][jmin1][k][1]) {
        dp[imin1][jmin1][k][1] = dp[i][j][k][l] + 1;
        sa[imin1][jmin1][k][1] = a[i] + sa[i][j][k][l];
        sb[imin1][jmin1][k][1] = b[j] + sb[i][j][k][l];
        top_down(imin1, jmin1, k, 1);
      }
    }
  }
}
signed main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  string s;
  long long tempa, tempb, tempc;
  char temp;
  getline(cin, s);
  stringstream ss;
  ss << s;
  ss >> tempa >> temp >> tempb >> temp >> tempc;
  a = to_string(tempa);
  b = to_string(tempb);
  c = to_string(tempc);
  base[0] = 1;
  for (long long i = 1; i <= 18; i++) base[i] = base[i - 1] * 10;
  a = "0" + a;
  b = "0" + b;
  c = "0" + c;
  numa[0] = numb[0] = numc[0] = "";
  for (long long i = 1; i < a.length(); i++) numa[i] = numa[i - 1] + a[i];
  for (long long i = 1; i < b.length(); i++) numb[i] = numb[i - 1] + b[i];
  for (long long i = 1; i < c.length(); i++) numc[i] = numc[i - 1] + c[i];
  for (long long i = 0; i < 21; i++)
    for (long long j = 0; j < 21; j++)
      for (long long k = 0; k < 21; k++) dp[i][j][k][0] = dp[i][j][k][1] = 1e18;
  dp[a.length() - 1][b.length() - 1][c.length() - 1][0] = 0;
  top_down(a.length() - 1, b.length() - 1, c.length() - 1, 0);
  long long ansa = stoll(sa[0][0][0][0]);
  long long ansb = stoll(sb[0][0][0][0]);
  cout << ansa << "+" << ansb << "=" << ansa + ansb;
}