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;
const long double PI = acosl(-1.0);
const double EPS = 1e-12;
void showBit(int no, int N) {
  for (int i = N - 1; i >= 0; i--)
    if ((no >> i) & 1)
      printf("1");
    else
      printf("0");
  printf("\n");
}
int binToDec(string s) {
  int ln = s.length();
  int sum = 0;
  for (int i = ln - 1, k = 0; i >= 0; i--, k++)
    sum = sum + (s[i] - '0') * (1 << k);
  return sum;
}
void combination(long long com[][1005]) {
  com[0][0] = 1;
  int sz = 1000;
  for (int i = 1; i <= sz; i++) {
    com[i][0] = 1;
    for (int j = 1; j <= i; j++) {
      com[i][j] = com[i - 1][j] + com[i - 1][j - 1];
      com[i][j] = com[i][j] % 1000000007;
    }
  }
}
int find_par(int cn) {}
int gcd(int u, int v) {
  if (v == 0) return u;
  return gcd(v, u % v);
}
void insert_ind(int cs, int ci, int s, int e) {
  if (s == e) {
    return;
  }
  int mid = (s + e) / 2;
  if (ci <= mid)
    insert_ind(2 * cs, ci, s, mid);
  else
    insert_ind(2 * cs + 1, ci, mid + 1, e);
}
void update_ind(int cs, int ci, int s, int e, int val) {
  if (s == e) {
    return;
  }
  int mid = (s + e) / 2;
  if (ci <= mid)
    update_ind(2 * cs, ci, s, mid, val);
  else
    update_ind(2 * cs + 1, ci, mid + 1, e, val);
}
void update_seg(int cs, int ds, int de, int s, int e, int val) {
  if (ds == s && de == e) {
    return;
  }
  int mid = (s + e) / 2;
  if (ds <= mid) update_seg(2 * cs, ds, min(mid, de), s, mid, val);
  if (de > mid) update_seg(2 * cs + 1, max(mid + 1, ds), de, mid + 1, e, val);
}
void pattern_match(char pat[], const int len, int pi[]) {
  pi[1] = 0;
  for (int i = 2; i <= len; i++) {
    int st = i - 1;
    while (st >= 0 && pat[pi[st] + 1] != pat[i]) st = pi[st];
    if (st == 0)
      pi[i] = 0;
    else
      pi[i] = pi[st] + 1;
  }
}
void pattern_match(char pat[], int pi[], char tar[], const int len1, int gi[]) {
  if (pat[0] == tar[0]) gi[0] = 1;
  for (int i = 1; i < len1; i++) {
    int st = gi[i - 1];
    while (pat[st] != tar[i]) {
      if (st == 0) {
        st = -1;
        break;
      }
      st = pi[st - 1];
    }
    if (st == -1)
      gi[i] = 0;
    else
      gi[i] = st + 1;
  }
}
struct myArray {
  int mat[10][10];
};
myArray matrix_mul(myArray mat1, myArray mat2, const int sz) {
  int tmp[sz][sz];
  memset((tmp), 0, sizeof((tmp)));
  for (int r = 0; r < sz; r++)
    for (int c = 0; c < sz; c++)
      for (int cr = 0; cr < sz; cr++)
        tmp[r][c] += mat1.mat[r][cr] * mat2.mat[c][cr];
  myArray res;
  for (int r = 0; r < sz; r++)
    for (int c = 0; c < sz; c++) res.mat[r][c] = tmp[r][c];
  return res;
}
myArray unit_matrix(const int sz) {
  myArray ma;
  memset((ma.mat), 0, sizeof((ma.mat)));
  for (int i = 0; i < sz; i++) ma.mat[i][i] = 1;
  return ma;
}
myArray matrix_expo(int p, myArray mat, const int sz) {
  if (p == 0) {
    return unit_matrix(sz);
  }
  if (p & 1) return matrix_mul(mat, matrix_expo(p - 1, mat, sz), sz);
  myArray tmp = matrix_expo(p >> 1, mat, sz);
  return matrix_mul(tmp, tmp, sz);
}
map<string, int> msi;
int X[] = {0, 0, 1, -1};
int Y[] = {1, -1, 0, 0};
const int dx[8] = {-1, 1, -2, 2, -1, 1, -2, 2};
const int dy[8] = {2, 2, -1, -1, -2, -2, 1, 1};
void cal_state(string s, int tran[][10]) {
  for (int i = 0; i < s.length(); i++) {
    for (int j = 0; j < 10; j++) {
      tran[i][j] = i + (s[s.length() - i - 1] == j + '0');
    }
  }
  for (int i = 0; i < 10; i++) tran[s.length()][i] = s.length();
}
string s1, s2, s3;
int tran1[10][10], tran2[10][10], tran3[10][10];
int dp[50][10][10][10][10][2][2];
struct node {
  int ln, s1, s2, s3, c, f, s, in1, in2, in3;
} p[50][10][10][10][10][2][2];
void get_ans(int l, int i, int j, int k, int c, int f, int s) {
  if (l == 0) return;
  node nd = p[l][i][j][k][c][f][s];
  if (nd.in1 != -1) s1 = s1 + (char)(nd.in1 + '0');
  if (nd.in2 != -1) s2 = s2 + (char)(nd.in2 + '0');
  s3 = s3 + (char)(nd.in3 + '0');
  get_ans(nd.ln, nd.s1, nd.s2, nd.s3, nd.c, nd.f, nd.s);
}
void cal(int ln, int ln1, int ln2) {
  dp[0][0][0][0][0][1][1] = 1;
  for (int l = 0; l < 50; l++)
    for (int i = 0; i < 10; i++)
      for (int j = 0; j < 10; j++)
        for (int k = 0; k < 10; k++)
          for (int c = 0; c < 10; c++)
            for (int f = 0; f < 2; f++)
              for (int s = 0; s < 2; s++)
                if (dp[l][i][j][k][c][f][s]) {
                  node nd1 = p[l][i][j][k][c][f][s];
                  if (!f && !s) {
                    int fst = k;
                    if (c) fst = tran3[k][c];
                    if (fst == ln && i == ln1 && j == ln2) {
                      s1 = s2 = s3 = "";
                      if (c) s3 = s3 + (char)('0' + c);
                      get_ans(l, i, j, k, c, f, s);
                      return;
                    }
                  } else {
                    for (int fd = 0; fd < 10; fd++)
                      for (int sd = 0; sd < 10; sd++) {
                        int fs = (f == 0 ? i : tran1[i][fd]);
                        int ss = (s == 0 ? j : tran2[j][sd]);
                        int sum = (f == 0 ? 0 : fd) + (s == 0 ? 0 : sd) + c;
                        int cr = sum / 10;
                        sum = sum % 10;
                        int ts = tran3[k][sum];
                        int l1 = l;
                        if (c) l1--;
                        int nl = l1 + (f == 0 ? 0 : 1) + (s == 0 ? 0 : 1) + 1 +
                                 (cr > 0);
                        node nd;
                        nd.ln = l;
                        nd.s1 = i, nd.s2 = j, nd.s3 = k, nd.c = c;
                        nd.f = f, nd.s = s;
                        nd.in1 = (f == 0 ? -1 : fd);
                        nd.in2 = (s == 0 ? -1 : sd);
                        nd.in3 = sum;
                        if (f && s) {
                          dp[nl][fs][ss][ts][cr][1][1] = 1;
                          p[nl][fs][ss][ts][cr][1][1] = nd;
                        }
                        if (f) {
                          dp[nl][fs][ss][ts][cr][1][0] = 1;
                          p[nl][fs][ss][ts][cr][1][0] = nd;
                        }
                        if (s) {
                          dp[nl][fs][ss][ts][cr][0][1] = 1;
                          p[nl][fs][ss][ts][cr][0][1] = nd;
                        }
                        dp[nl][fs][ss][ts][cr][0][0] = 1;
                        p[nl][fs][ss][ts][cr][0][0] = nd;
                      }
                  }
                }
}
int main() {
  cin >> s1;
  s2 = s1.substr(s1.find('+') + 1, s1.find('=') - s1.find('+') - 1);
  s3 = s1.substr(s1.find('=') + 1);
  s1 = s1.substr(0, s1.find('+'));
  cal_state(s1, tran1);
  cal_state(s2, tran2);
  cal_state(s3, tran3);
  cal(s3.length(), s1.length(), s2.length());
  cout << s1 << "+" << s2 << "=" << s3 << endl;
  return 0;
}