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: Runtime Error)

#include<iostream> 
#include<cstdio>
#include<cstring>
#include<math.h>
using namespace std; 
int s[4];
int main() 
{ 
	int ans;
	string n="+++",m;
	cin>>m;
	for(int i=0;i<=3;i++)
	{
		s[i+1]=int(m[i])-'0'; 
	}
	for(int i=1;i<=4;i++)
	{
		ans=ans+s[i];
	}
	for(int i=2;i<=4;i++)
	{
		ans=ans-2*s[i];
		if(ans==7)
		{
			n[i-2]='-';
		}
		else
		{
			if(ans<7)
			{
				ans=ans+2*s[i];
			}
			else
			{
				for(int j=i+1;j<=4;j++)
				{
					ans=ans-2*s[j];
					if(ans==7)
					{
						n[i-2]='-';
						n[j-2]='-';
						break;
					}
					else
					{
						if(ans<7)
						{
							ans=ans+2*s[j];
						}
						else
						{
							for(int k=j+1;k<=4;k++)
							{
								ans=ans-2*s[k];
								if(ans==7)
								{
									n[i-2]='-';
									n[j-2]='-';
									n[k-2]='-';
									break;
								}
							}
						}
					}
				}
			}
		}
	}
	cout<<s[1];
	for(int i=0;i<=2;i++)
	{
		cout<<n[i];
		cout<<s[i+2];
	}
	cout<<"=7";
}