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.IOException;

import java.io.BufferedReader;
import java.io.InputStreamReader;

import java.io.PrintWriter;

@SuppressWarnings("unchecked")
public class Main {
    static final int MAX_NUM = 4;
    static final int B = 8;
     static final int TARGET = 7;

    static int[] num = new int [MAX_NUM];
    static char[] op = new char[MAX_NUM - 1];

    public static void main(String[] args) throws IOException {
        final String s;

        try (
            BufferedReader reader = new BufferedReader(
                new InputStreamReader(System.in))) {
            s = reader.readLine();
        }

        PrintWriter out = new PrintWriter(System.out);

        for (int i = 0; i < s.length(); i++)
            num[i] = s.charAt(i) - '0';

        for (int i = 0; i < B; i++) {
            int tmp = num[0];

            for (int j = 0; j < MAX_NUM - 1; j++) {
                op[j] = '+';

                if ((i >> j & 1) == 1) {
                    op[j] = '-';
                    tmp -= num[j + 1];
                } else tmp += num[j + 1];
            }

            boolean flg = false;

            if (tmp == TARGET) {
                for (i = 0; i < MAX_NUM; i++) {
                    out.print(num[i]);

                    if (i == MAX_NUM - 1) {
                        flg = true;
                        break;
                    }

                    out.print(op[i]);
                }
            }

            if (flg) break;
        }

        out.println("=" + String.valueOf(TARGET));

        out.flush();
    }
}