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 Java (OpenJDK 11.0.6) (judge verdict: Wrong Answer)

import java.util.Scanner;

public class Main {
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		String s = sc.next();
		char[] c = s.toCharArray();
		int[] num = new int[c.length];
		for(int n = 0; n < c.length;n++) {
			num[n] = c[n] - '0';
		}
		String[] e = new String[3];
		for(int h = 0; h <3; h++) {
			e[h] = "+";
		}
		for(int i = 0; i <= 1; i++) {
			int sum = num[0];
			if(i == 1) {
				sum -= num[1];
				e[0] = "-";
			}
			else {
				sum += num[1];
				e[0] = "+";
			}
			for(int j = 0; j <= 1; j++) {
				if(j == 1) {
					sum -= num[2];
					e[1] = "-";
				}
				else {
					sum+= num[2];
					e[1] = "+";
				}
				for(int k = 0; k <= 1; k++) {
					if(k == 1) {
						sum -= num[3];
						e[2] ="-";
					}
					else {
						sum+=num[3];
						e[2] = "+";
					}
					if(sum==7) {
						System.out.println(num[0] + e[0]+num[1]+e[1]+num[2]+e[2]+num[3]+"=7");
						return;
					}
					sum += num[3]*-1;
				}
				 sum += num[2]*-1;
			}
			sum += num[1]*-1;
		}
	}
}