A correct expression of the form a+b=c was written; a, b and c are non-negative integers without leading zeros. In this expression, the plus and equally signs were lost. The task is to restore the expression. In other words, one character '+' and one character '=' should be inserted into given sequence of digits so that: 

  * character'+' is placed on the left of character '=', 
  * characters '+' and '=' split the sequence into three non-empty subsequences consisting of digits (let's call the left part a, the middle part — b and the right part — c), 
  * all the three parts a, b and c do not contain leading zeros, 
  * it is true that a+b=c. 



It is guaranteed that in given tests answer always exists.

Input

The first line contains a non-empty string consisting of digits. The length of the string does not exceed 106.

Output

Output the restored expression. If there are several solutions, you can print any of them.

Note that the answer at first should contain two terms (divided with symbol '+'), and then the result of their addition, before which symbol'=' should be. 

Do not separate numbers and operation signs with spaces. Strictly follow the output format given in the examples.

If you remove symbol '+' and symbol '=' from answer string you should get a string, same as string from the input data.

Examples

Input

12345168


Output

123+45=168


Input

099


Output

0+9=9


Input

199100


Output

1+99=100


Input

123123123456456456579579579


Output

123123123+456456456=579579579
import java.io.*;
import java.math.BigInteger;
import java.util.Random;
import java.util.StringTokenizer;

public class Main {

    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        InputReader inputReader = new InputReader(inputStream);
        PrintWriter printWriter = new PrintWriter(outputStream);
        Solver solver = new Solver(inputReader);
        solver.solve(printWriter);
        printWriter.close();
    }

    static class Solver {

        private int n;
        private String s;
        private int mod;
        private int[] tenMod;
        private int[] hash;

        Solver(InputReader in) {
            s = in.next();
        }

        void solve(PrintWriter out) {
            mod = genPrimeModulo((int) 7e7, (int) 1e9);
            while (!BigInteger.valueOf(mod).isProbablePrime(1)) {
                ++mod;
            }

            n = s.length();

            tenMod = new int[n];
            tenMod[0] = 1;
            for (int i = 1; i < n; ++i) {
                tenMod[i] = (int) (tenMod[i - 1] * 10L % mod);
            }

            hash = new int[n + 1];
            for (int i = 0; i < n; i++) {
                hash[i + 1] = (int) ((hash[i] * 10L + Character.digit(s.charAt(i), 10)) % mod);
            }
            for (int cStart = 0; cStart < n; ++cStart) {
                int cLen = n - cStart;
                if (isAnswer(cLen, cStart)) {
                    printAnswer(out, cLen, cStart);
                } else if (isAnswer(cLen - 1, cStart)) {
                    printAnswer(out, cLen - 1, cStart);
                } else if (isAnswer(cStart - cLen, cStart)) {
                    printAnswer(out, cStart - cLen, cStart);
                } else if (isAnswer(cStart - cLen + 1, cStart)) {
                    printAnswer(out, cStart - cLen + 1, cStart);
                }
            }
        }

        private void printAnswer(PrintWriter out, int bStart, int cStart) {
            for (int i = 0; i < n; ++i) {
                if (i == bStart) {
                    out.print('+');
                } else if (i == cStart) {
                    out.print('=');
                }
                out.print(s.charAt(i));
            }
        }

        private boolean isAnswer(int bStart, int cStart) {
            if (isNumberInvalid(0, bStart) || isNumberInvalid(bStart, cStart)
                    || isNumberInvalid(cStart, n)) {
                return false;
            }
            if ((getHash(0, bStart) + getHash(bStart, cStart)) % mod == getHash(cStart, n)) {
                return true;
            }
            return false;
        }

        private int getHash(int l, int r) {
            int result = (int) ((hash[r] - (long) hash[l] * tenMod[r - l]) % mod);
            if (result < 0) {
                result += mod;
            }
            return result;
        }

        private boolean isNumberInvalid(int l, int r) {
            if (r - l <= 0) {
                return true;
            }
            return r - l != 1 && s.charAt(l) == '0';
        }

        private int genPrimeModulo(int range, int atleast) {
            Random random = new Random();
            return random.nextInt(range) + atleast;
        }
    }

    static class InputReader {
        BufferedReader reader;
        StringTokenizer tokenizer;

        InputReader(InputStream stream) {
            reader = new BufferedReader(new InputStreamReader(stream), 32768);
            tokenizer = null;
        }

        String next() {
            while (tokenizer == null || !tokenizer.hasMoreTokens()) {
                try {
                    tokenizer = new StringTokenizer(reader.readLine());
                } catch (IOException e) {
                    throw new RuntimeException(e);
                }
            }
            return tokenizer.nextToken();
        }

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