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

public class Main {

	final static long MOD = 1000000007;
	public static int[] X = new int[4];
	public static void main(String[] args) throws Exception {
		// TODO 自動生成されたメソッド・スタブ
		BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
		String S = in.readLine();

		X[0] = Integer.parseInt(String.valueOf(S.charAt(0)));
		X[1] = Integer.parseInt(String.valueOf(S.charAt(1)));
		X[2] = Integer.parseInt(String.valueOf(S.charAt(2)));
		X[3] = Integer.parseInt(String.valueOf(S.charAt(3)));


		System.out.println(op(0,new String[3],X[0]));
	}

	public static String op(int idx,String[] op,int sum){
		if(idx==3){
			if(sum==7){
				return X[0]+op[0]+X[1]+op[1]+X[2]+op[2]+X[3]+"=7";
			}else{
				return null;
			}
		}
		op[idx]="+";
		String ans = op(idx+1,op,sum+X[idx+1]);
		if(ans!=null){
			return ans;
		}
		op[idx]="-";
		return op(idx+1,op,sum-X[idx+1]);

	}
}