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 JAVA):

Solution:
//package codeforces;

import java.io.BufferedReader;
import java.io.Closeable;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.*;

public class E implements Closeable {
    BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));
    PrintWriter writer = new PrintWriter(System.out);
    StringTokenizer stringTokenizer;

    String next() throws IOException {
        while (stringTokenizer == null || !stringTokenizer.hasMoreTokens()) {
            stringTokenizer = new StringTokenizer(reader.readLine());
        }
        return stringTokenizer.nextToken();
    }

    int nextInt() throws IOException {
        return Integer.parseInt(next());
    }

    long nextLong() throws IOException {
        return Long.parseLong(next());
    }

    final int MOD = 1000 * 1000 * 1000 + 7;

    int sum(int a, int b) {
        a += b;
        return a >= MOD ? a - MOD : a;
    }

    int product(int a, int b) {
        return (int) (1l * a * b % MOD);
    }

    int pow(int x, int k) {
        int result = 1;
        while (k > 0) {
            if (k % 2 == 1) {
                result = product(result, x);
            }
            x = product(x, x);
            k /= 2;
        }
        return result;
    }

    @SuppressWarnings("unchecked")
    void solve() throws IOException {
        class Utils {
            int[] getDigitsReversed(String s) {
                int[] digits = new int[s.length()];
                for(int i = 0; i < digits.length; i++) {
                    digits[i] = s.charAt(s.length() - 1 - i) - '0';
                }
                return digits;
            }
        }
        String s = next();
        Utils utils = new Utils();
        final int[] a = utils.getDigitsReversed(s.substring(0, s.indexOf('+')));
        final int[] b = utils.getDigitsReversed(s.substring(s.indexOf('+') + 1, s.indexOf('=')));
        final int[] c = utils.getDigitsReversed(s.substring(s.indexOf('=') + 1));
        String currentBest = "zzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzz" +
                "zzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzz";
        final boolean[][][][][] cache = new boolean[a.length + 1][b.length + 1][c.length + 1][2][15];
        final int[][][][][] marked = new int[a.length + 1][b.length + 1][c.length + 1][2][15];
        int globalMarker = 1;
        for(int xLen = a.length; xLen <= 14; xLen++) {
            for(int yLen = b.length; yLen <= 14; yLen++) {
                for(int zLen = Math.max(c.length, Math.max(xLen, yLen)); zLen <= 14; zLen++) {
                    if(xLen + yLen + zLen + 2 >= currentBest.length()) {
                        continue;
                    }
                    class Solver {
                        final int xLen, yLen, zLen;
                        final int maxLen;
                        int[] x, y;

                        public Solver(int xLen, int yLen, int zLen) {
                            this.xLen = xLen;
                            this.yLen = yLen;
                            this.zLen = zLen;
                            maxLen = zLen;
                            x = new int[maxLen];
                            y = new int[maxLen];
                        }

                        boolean canConstruct(int usedA, int usedB, int usedC, int overflow, int pos) {
                            if(pos == maxLen) {
                                return usedA == a.length && usedB == b.length && usedC == c.length && overflow == 0;
                            }
                            int dA = usedA < a.length ? a[usedA] : 0;
                            int dB = usedB < b.length ? b[usedB] : 0;
                            int dC = usedC < c.length ? c[usedC] : 0;
                            for(int i = 0; i < (pos < xLen ? 10 : 1); i++) {
                                for(int j = 0; j < (pos < yLen ? 10 : 1); j++) {
                                    if(canConstruct(
                                            Math.min(a.length, usedA + (dA == i ? 1 : 0)),
                                            Math.min(b.length, usedB + (dB == j ? 1 : 0)),
                                            Math.min(c.length, usedC + ((i + j + overflow) % 10 == dC ? 1 : 0)),
                                            (i + j + overflow) / 10,
                                            pos + 1
                                    )) {
                                        return true;
                                    }
                                }
                            }
                            return false;
                        }

                        void construct(int usedA, int usedB, int usedC, int overflow, int pos) {
                            if(pos == maxLen) {
                                return;
                            }
                            int dA = usedA < a.length ? a[usedA] : 0;
                            int dB = usedB < b.length ? b[usedB] : 0;
                            int dC = usedC < c.length ? c[usedC] : 0;
                            for(int i = 0; i < (pos < xLen ? 10 : 1); i++) {
                                for(int j = 0; j < (pos < yLen ? 10 : 1); j++) {
                                    if(canConstruct(
                                            Math.min(a.length, usedA + (dA == i ? 1 : 0)),
                                            Math.min(b.length, usedB + (dB == j ? 1 : 0)),
                                            Math.min(c.length, usedC + ((i + j + overflow) % 10 == dC ? 1 : 0)),
                                            (i + j + overflow) / 10,
                                            pos + 1
                                    )) {
                                        x[pos] = i;
                                        y[pos] = j;
                                        construct(Math.min(a.length, usedA + (dA == i ? 1 : 0)),
                                                Math.min(b.length, usedB + (dB == j ? 1 : 0)),
                                                Math.min(c.length, usedC + ((i + j + overflow) % 10 == dC ? 1 : 0)),
                                                (i + j + overflow) / 10,
                                                pos + 1);
                                    }
                                }
                            }
                        }
                    }

                    class CachedSolver extends Solver {
                        int marker;

                        public CachedSolver(int xLen, int yLen, int zLen, int marker) {
                            super(xLen, yLen, zLen);
                            this.marker = marker;
                        }

                        @Override
                        boolean canConstruct(int usedA, int usedB, int usedC, int overflow, int pos) {
                            if(marked[usedA][usedB][usedC][overflow][pos] != marker) {
                                marked[usedA][usedB][usedC][overflow][pos] = marker;
                                cache[usedA][usedB][usedC][overflow][pos] = super.canConstruct(usedA, usedB, usedC, overflow, pos);
                            }
                            return cache[usedA][usedB][usedC][overflow][pos];
                        }
                    }

                    Solver solver = new CachedSolver(xLen, yLen, zLen, globalMarker++);
                    if(solver.canConstruct(0, 0, 0, 0, 0)) {
                        solver.construct(0, 0, 0, 0, 0);
                        long X = 0, Y = 0;
                        for(int i = zLen - 1; i >= 0; i--) {
                            X *= 10;
                            Y *= 10;
                            X += solver.x[i];
                            Y += solver.y[i];
                        }
                        currentBest = String.format("%d+%d=%d", X, Y, X + Y);
                    }
                }
            }
        }
        writer.println(currentBest);
    }

    public static void main(String[] args) throws IOException {
        try(E e = new E()) {
            e.solve();
        }
    }

    @Override
    public void close() throws IOException {
        reader.close();
        writer.close();
    }
}