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:
// practice with rainboy
import java.io.*;
import java.util.*;

public class CF58E extends PrintWriter {
	CF58E() { super(System.out, true); }
	Scanner sc = new Scanner(System.in);
	public static void main(String[] $) {
		CF58E o = new CF58E(); o.main(); o.flush();
	}

	void flip(byte[] aa, int n) {
		for (int i = 0, j = n - 1; i < j; i++, j--) {
			byte tmp = aa[i]; aa[i] = aa[j]; aa[j] = tmp;
		}
		for (int i = 0; i < n; i++)
			aa[i] -= '0';
	}
	int[][][][] dp0, dp1, dq0, dq1;
	long[][][][] xp0, xp1, yp0, yp1, xq0, xq1, yq0, yq1;
	void update0(int ia, int ib, int ic, int la, int lb, long x, long y) {
		if (dq0[ia][ib][ic][la] < lb) {
			dq0[ia][ib][ic][la] = lb;
			xq0[ia][ib][ic][la] = x;
			yq0[ia][ib][ic][la] = y;
		}
	}
	void update1(int ia, int ib, int ic, int la, int lb, long x, long y) {
		if (dq1[ia][ib][ic][la] < lb) {
			dq1[ia][ib][ic][la] = lb;
			xq1[ia][ib][ic][la] = x;
			yq1[ia][ib][ic][la] = y;
		}
	}
	void main() {
		String s = sc.next();
		int n = s.length();
		int p = s.indexOf('+');
		int q = s.indexOf('=');
		byte[] aa = s.substring(0, p).getBytes();
		byte[] bb = s.substring(p + 1, q).getBytes();
		byte[] cc = s.substring(q + 1, n).getBytes();
		int na = aa.length;
		int nb = bb.length;
		int nc = cc.length;
		flip(aa, na);
		flip(bb, nb);
		flip(cc, nc);
		n = Math.max(na, nb) + 1 + nc;
		dp0 = new int[na + 1][nb + 1][nc + 1][n + 1];
		dp1 = new int[na + 1][nb + 1][nc + 1][n + 1];
		dq0 = new int[na + 1][nb + 1][nc + 1][n + 1];
		dq1 = new int[na + 1][nb + 1][nc + 1][n + 1];
		xp0 = new long[na + 1][nb + 1][nc + 1][n + 1];
		xp1 = new long[na + 1][nb + 1][nc + 1][n + 1];
		yp0 = new long[na + 1][nb + 1][nc + 1][n + 1];
		yp1 = new long[na + 1][nb + 1][nc + 1][n + 1];
		xq0 = new long[na + 1][nb + 1][nc + 1][n + 1];
		xq1 = new long[na + 1][nb + 1][nc + 1][n + 1];
		yq0 = new long[na + 1][nb + 1][nc + 1][n + 1];
		yq1 = new long[na + 1][nb + 1][nc + 1][n + 1];
		for (int ia = 0; ia <= na; ia++)
			for (int ib = 0; ib <= nb; ib++)
				for (int ic = 0; ic <= nc; ic++) {
					Arrays.fill(dp0[ia][ib][ic], -1);
					Arrays.fill(dp1[ia][ib][ic], -1);
				}
		dp0[0][0][0][0] = 0;
		int ans = 100;
		long ansx = -1, ansy = -1, t = 1;
		for (int h = 0; h < n; h++) {
			for (int ia = 0; ia <= na; ia++)
				for (int ib = 0; ib <= nb; ib++)
					for (int ic = 0; ic <= nc; ic++) {
						Arrays.fill(dq0[ia][ib][ic], -1);
						Arrays.fill(dq1[ia][ib][ic], -1);
					}
			for (int ia = 0; ia <= na; ia++)
				for (int ib = 0; ib <= nb; ib++)
					for (int ic = 0; ic <= nc; ic++)
						for (int la = 0; la <= n; la++) {
							int lb = dp0[ia][ib][ic][la];
							if (lb >= 0) {
								long x = xp0[ia][ib][ic][la];
								long y = yp0[ia][ib][ic][la];
								for (int a = 0; a < 10; a++) {
									int ia_ = ia < na && aa[ia] == a ? ia + 1 : ia;
									int la_ = a == 0 ? la + 1 : 0;
									long x_ = x + t * a;
									for (int b = 0; b < 10; b++) {
										int ib_ = ib < nb && bb[ib] == b ? ib + 1 : ib;
										int lb_ = b == 0 ? lb + 1 : 0;
										long y_ = y + t * b;
										int c = a + b;
										if (c < 10) {
											int ic_ = ic < nc && cc[ic] == c ? ic + 1 : ic;
											update0(ia_, ib_, ic_, la_, lb_, x_, y_);
										} else {
											int ic_ = ic < nc && cc[ic] == c - 10 ? ic + 1 : ic;
											update1(ia_, ib_, ic_, la_, lb_, x_, y_);
										}
									}
								}
							}
							lb = dp1[ia][ib][ic][la];
							if (lb >= 0) {
								long x = xp1[ia][ib][ic][la];
								long y = yp1[ia][ib][ic][la];
								for (int a = 0; a < 10; a++) {
									int ia_ = ia < na && aa[ia] == a ? ia + 1 : ia;
									int la_ = a == 0 ? la + 1 : 0;
									long x_ = x + t * a;
									for (int b = 0; b < 10; b++) {
										int ib_ = ib < nb && bb[ib] == b ? ib + 1 : ib;
										int lb_ = b == 0 ? lb + 1 : 0;
										long y_ = y + t * b;
										int c = a + b + 1;
										if (c < 10) {
											int ic_ = ic < nc && cc[ic] == c ? ic + 1 : ic;
											update0(ia_, ib_, ic_, la_, lb_, x_, y_);
										} else {
											int ic_ = ic < nc && cc[ic] == c - 10 ? ic + 1 : ic;
											update1(ia_, ib_, ic_, la_, lb_, x_, y_);
										}
									}
								}
							}
						}
			for (int la = 0; la <= n; la++) {
				int lb = dq0[na][nb][nc][la];
				if (lb >= 0) {
					int cnt = (h + 1) * 3 - la - lb;
					if (ans > cnt) {
						ans = cnt;
						ansx = xq0[na][nb][nc][la];
						ansy = yq0[na][nb][nc][la];
					}
				}
			}
			int[][][][] tmp;
			tmp = dp0; dp0 = dq0; dq0 = tmp;
			tmp = dp1; dp1 = dq1; dq1 = tmp;
			long[][][][] tmp_;
			tmp_ = xp0; xp0 = xq0; xq0 = tmp_;
			tmp_ = yp0; yp0 = yq0; yq0 = tmp_;
			tmp_ = xp1; xp1 = xq1; xq1 = tmp_;
			tmp_ = yp1; yp1 = yq1; yq1 = tmp_;
			t *= 10;
		}
		println(ansx + "+" + ansy + "=" + (ansx + ansy));
	}
}