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

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define rep(i,n) for(int (i)=0; (i) < (n); (i)++)

int main()
{
	string S; cin >> S;
	ll a, b, c, d;
	a = S[0] - '0';
	b = S[1] - '0';
	c = S[2] - '0';
	d = S[3] - '0';
	//cout << a << " " << b << " " << c << " " << d << endl;

	ll index = 0;
	string ans = "";
	rep(i, (1<<3)) {
		ll tmp = S[0] - '0';
		ans = S[0];
		index = 1;
		rep (j, 3) {
			if ((i >> j) & 0x01) {
				tmp += S[index] - '0';
				ans += '+'; ans += S[index];
			}
			else {
				tmp -= S[index] - '0';
				ans += '-'; ans += S[index];
			}
			index++;
		}
		if (tmp == 7) {
			ans += "=7";
			cout << ans << endl;
			exit(0); 
		}

	}
	


}