Problem:
Score : 300 points

Problem Statement

Sitting in a station waiting room, Joisino is gazing at her train ticket.

The ticket is numbered with four digits A, B, C and D in this order, each between 0 and 9 (inclusive).

In the formula A op1 B op2 C op3 D = 7, replace each of the symbols op1, op2 and op3 with + or - so that the formula holds.

The given input guarantees that there is a solution. If there are multiple solutions, any of them will be accepted.

Constraints

0≤A,B,C,D≤9

All input values are integers.

It is guaranteed that there is a solution.

Input

Input is given from Standard Input in the following format:

ABCD

Output

Print the formula you made, including the part =7.

Use the signs + and -.

Do not print a space between a digit and a sign.

Sample Input 1

1222

Sample Output 1

1+2+2+2=7

This is the only valid solution.

Sample Input 2

0290

Sample Output 2

0-2+9+0=7

0 - 2 + 9 - 0 = 7 is also a valid solution.

Sample Input 3

3242

Sample Output 3

3+2+4-2=7

Solution in Java8 (OpenJDK 1.8.0) (judge verdict: Accepted)

import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Scanner;

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 *
 * @author ZYCSwing
 */
public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        Scanner in = new Scanner(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        TaskC solver = new TaskC();
        solver.solve(1, in, out);
        out.close();
    }

    static class TaskC {
        public void solve(int testNumber, Scanner in, PrintWriter out) {
            String s = in.next();

            int[] nums = new int[4];
            for (int i = 0; i < 4; ++i) {
                nums[i] = s.charAt(i) - '0';
            }

            for (int i = 0; i < 2; ++i) {
                int tmp = nums[0];
                StringBuffer sb = new StringBuffer();
                sb.append("" + nums[0]);
                if (i == 0) {
                    tmp += nums[1];
                    sb.append("+");
                } else {
                    tmp -= nums[1];
                    sb.append("-");
                }
                sb.append("" + nums[1]);
                for (int j = 0; j < 2; ++j) {
                    if (j == 0) {
                        tmp += nums[2];
                        sb.append("+");
                    } else {
                        tmp -= nums[2];
                        sb.append("-");
                    }
                    sb.append("" + nums[2]);
                    for (int k = 0; k < 2; ++k) {
                        if (k == 0) {
                            tmp += nums[3];
                            sb.append("+");
                        } else {
                            tmp -= nums[3];
                            sb.append("-");
                        }
                        sb.append("" + nums[3]);
                        if (tmp == 7) {
                            out.println(sb.toString() + "=7");
                            return;
                        }
                        if (k == 0) {
                            tmp -= nums[3];
                        } else {
                            tmp += nums[3];
                        }
                        sb.deleteCharAt(sb.length() - 1);
                        sb.deleteCharAt(sb.length() - 1);
                    }
                    if (j == 0) {
                        tmp -= nums[2];
                    } else {
                        tmp += nums[2];
                    }
                    sb.deleteCharAt(sb.length() - 1);
                    sb.deleteCharAt(sb.length() - 1);
                }
            }
        }

    }
}