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
/*
Keep solving problems.
*/

import java.math.BigInteger;
import java.util.*;
import java.io.*;

public class CFA {
    BufferedReader br;
    PrintWriter out;
    StringTokenizer st;
    boolean eof;
    private static final long MOD = 1000 * 1000 * 1000 + 7;
    private static final int[] dx = {0, -1, 0, 1};
    private static final int[] dy = {1, 0, -1, 0};
    private static final String yes = "YES";
    private static final String no = "NO";

    int n;
    char[] arr;
    long[] pow1;
    long[] pow2;
    long[] pref1;
    long[] pref2;
    String str;
    long mod1;
    long mod2;
    void solve() throws IOException {
        str = nextString();
        arr = str.toCharArray();
        n = arr.length;
        int limit = 1000000 + 10;
        pow1 = new long[limit];
        pow2 = new long[limit];
        pref1 = new long[limit];
        pref2 = new long[limit];
        mod1 = MOD;
        mod2 = MOD + 2;
        buildHash(mod1, pref1);
        buildHash(mod2, pref2);
        pow1[0] = 1;
        pow2[0] = 1;
        for (int i = 1; i < limit; i++) {
            pow1[i] = pow1[i - 1] * 10 % mod1;
            pow2[i] = pow2[i - 1] * 10 % mod2;
        }

        for (int l3 = 1; l3 < n; l3++) {
            int l1 = l3;
            int l2 = n - l1 - l3;
            if (check(l1, l2)) {
                print(l1, l2);
                return;
            }
            l1 = l3 - 1;
            l2 = n - l1 - l3;
            if (check(l1, l2)) {
                print(l1, l2);
                return;
            }

            l2 = l3;
            l1 = n - l2 - l3;
            if (check(l1, l2)) {
                print(l1, l2);
                return;
            }

            l2 = l3 - 1;
            l1 = n - l2 - l3;
            if (check(l1, l2)) {
                print(l1, l2);
                return;
            }
        }
    }

    void buildHash(long mod, long[] pref) {
        for (int i = 1; i <= n; i++) {
            pref[i] = (10 * pref[i - 1] + (arr[i - 1] - '0')) % mod;
        }
    }

    void print(int l1, int l2) {
        for (int i = 0; i < n; i++) {
            out(arr[i]);
            if (i == l1 - 1) {
                out("+");
            }
            else if (i == l1 + l2 - 1) {
                out("=");
            }
        }
    }

    boolean check(int l1, int l2) {
        int l3 = n - l1 - l2;
        if (l1 <= 0 || l2 <= 0 || l1 > l3 || l2 > l3) {
            return false;
        }

        if (l1 > 1 && arr[0] == '0') {
            return false;
        }
        if (l2 > 1 && arr[l1] == '0') {
            return false;
        }
        if (l3 > 1 && arr[l1 + l2] == '0') {
            return false;
        }

        long v1 = pref1[l1];
        long tmp = pref1[l1] * pow1[l2] % mod1;
        long v2 = pref1[l1 + l2] - tmp;
        if (v2 < 0) {
            v2 += mod1;
        }
        tmp = pref1[l1 + l2] * pow1[l3] % mod1;
        long v3 = pref1[n] - tmp;
        if (v3 < 0) {
            v3 += mod1;
        }
        if ((v1 + v2) % mod1 != v3) {
            return false;
        }

        v1 = pref2[l1];
        tmp = pref2[l1] * pow2[l2] % mod2;
        v2 = pref2[l1 + l2] - tmp;
        if (v2 < 0) {
            v2 += mod2;
        }
        tmp = pref2[l1 + l2] * pow2[l3] % mod2;
        v3 = pref2[n] - tmp;
        if (v3 < 0) {
            v3 += mod2;
        }
        if ((v1 + v2) % mod2 != v3) {
            return false;
        }

//        BigInteger b1 = new BigInteger(str.substring(0, l1));
//        BigInteger b2 = new BigInteger(str.substring(l1, l1 + l2));
//        BigInteger b3 = new BigInteger(str.substring(l1 + l2));
        return true;
    }

    void shuffle(int[] a) {
        int n = a.length;
        for(int i = 0; i < n; i++) {
            int r = i + (int) (Math.random() * (n - i));
            int tmp = a[i];
            a[i] = a[r];
            a[r] = tmp;
        }
    }

    int gcd(int a, int b) {
        while(a != 0 && b != 0) {
            int c = b;
            b = a % b;
            a = c;
        }
        return a + b;
    }

    private void outln(Object o) {
        out.println(o);
    }
    private void out(Object o) {
        out.print(o);
    }
    public CFA() throws IOException {
        br = new BufferedReader(new InputStreamReader(System.in));
        out = new PrintWriter(System.out);
        solve();
        out.close();
    }
    public static void main(String[] args) throws IOException {
        new CFA();
    }

    public long[] nextLongArr(int n) throws IOException{
        long[] res = new long[n];
        for(int i = 0; i < n; i++)
            res[i] = nextLong();
        return res;
    }
    public int[] nextIntArr(int n) throws IOException {
        int[] res = new int[n];
        for(int i = 0; i < n; i++)
            res[i] = nextInt();
        return res;
    }
    public String nextToken() {
        while (st == null || !st.hasMoreTokens()) {
            try {
                st = new StringTokenizer(br.readLine());
            } catch (Exception e) {
                eof = true;
                return null;
            }
        }
        return st.nextToken();
    }
    public String nextString() {
        try {
            return br.readLine();
        } catch (IOException e) {
            eof = true;
            return null;
        }
    }
    public int nextInt() throws IOException {
        return Integer.parseInt(nextToken());
    }
    public long nextLong() throws IOException {
        return Long.parseLong(nextToken());
    }
    public double nextDouble() throws IOException {
        return Double.parseDouble(nextToken());
    }
}

