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: Wrong Answer)

 //ID:computerbox --> Hajiyev Huseyn
#include <bits/stdc++.h>
#define FAST_READ ios_base::sync_with_stdio(0);/*cin.tie(0); cout.tie(0);*/
#define in freopen("input.txt", "r", stdin);
#define out freopen("output.txt", "w", stdout);
#define ll long long
#define debt(x,y)cout<<"#x = "<<(x)<<" and "<<"#y = "<<(y)<<endl;
#define deb(x)cout<<"#x = "<<(x)<<endl;
#define COUT(n, a) cout<< fixed << setprecision(a) << n<<endl
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define endl "\n"
#define arr(a,n) for(ll i=1;i<=n;i++) cout<<a[i]<<" "; cout << "\n";
#define vecc(a,n) for(ll i=0;i<n;i++) cout<<a[i]<<" "; cout << "\n";
#define CURTIME() cerr << clock() * 1.0 / CLOCKS_PER_SEC << endl
#define DTIME(ccc) __begin = clock(); ccc; cerr<<"Time of work = "<<(clock()-__begin)/CLOCKS_PER_SEC<<endl;
#define MAXN 200010

using namespace std;

string cislo;

ll sum=0;
vector<char>zn;
vector<char>ans;
int main(){
FAST_READ;
cin>>cislo;
ll cnt=0;

for(ll i=1;i<=3;i++)
{
	zn.pb('+');
}
for(ll i=1;i<=3;i++)
{
	zn.pb('-');
}
ll zns=4;
while(1)
{
  ans.clear();
  ll sum=cislo[0]-'0';
  for(ll i=0;i<3;i++)
  {

  	if(zn[i]=='+')
  	{
  		//eb(1);
  		sum=sum+(cislo[i+1]-'0');
  		ans.pb('+');
  	}
  	else
  	{
  		sum=sum-(cislo[i+1]-'0');
  		ans.pb('-');
  	}
   
  }
 // deb(sum);
  if(sum==7)
  {
  	break;
  }
  next_permutation(all(zn));
  //vecc(zn,zn.size());
}
for(ll i=0;i<cislo.size();i++)
{
	cout<<cislo[i];
	if(i!=cislo.size()-1)cout<<ans[i];
}
cout<<endl;
//cout<<sum<<endl;




return 0;
}