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 C++14 (GCC 5.4.1) (judge verdict: Accepted)

#include <iostream>

using namespace std;

int main()
{
	int A, B, C, D, in;

	cin >> in;
	D = in % 10;
	C = (int)(in / 10) % 10;
	B = (int)(in / 100) % 10;
	A = (int)(in / 1000);
	int sum;
	char op[3];

	for (int i = 0; i < 8; i++)
	{
		sum = 0;
		if ((i & 4) >> 2 == 1)
		{
			sum = A + B;
			op[2] = '+';
		}
		else
		{
			sum = A - B;
			op[2] = '-';
		}

		if ((i & 2) >> 1 == 1)
		{
			sum += C;
			op[1] = '+';
		}
		else
		{
			sum -= C;
			op[1] = '-';
		}
		if ((i & 1) == 1)
		{
			sum += D;
			op[0] = '+';
		}
		else
		{
			sum -= D;
			op[0] = '-';
		}

		if (sum == 7)
		{
			cout << A << op[2] << B << op[1] << C << op[0] << D << "=7" << endl;
			break;
		}
	}

	return 0;
}