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)

#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <ctime>
#include <list>
#include <numeric>
#include <utility>
#include <ctime>
#define INF 100000000
#define LINF 9000000000000000000
#define mod 1000000007
 
#define rep(i,n) for(int i=0;i<int(n);i++)
#define REP(i,a,b) for(int i=(a);i<int(b);i++)
#define all(x) (x).begin(),x.end()
#define pb push_back
#define mp make_pair
#define MOD(x) (x%(mod))
 
using namespace std;
 
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef pair<int,int> pi;
 
int dx[4]={1,0,-1,0};
int dy[4]={0,1,0,-1};
bool debug=false;

/*---------------------------------------------------*/

int data[4];

void string_to_int(string s){
  rep(i,4){
    char c=s[i];
    //cout<<c-'0'<<endl;
    data[i]=(c-'0');
  }
}

void solve(){
  int sum=0;
  rep(i,2){
    rep(j,2){
      rep(k,2){
	sum=data[0];
	string ans=to_string(data[0]);
	if(i==0){
	  sum+=data[1];
	  ans=ans+'+'+to_string(data[1]);
	}else{
	  sum-=data[1];
	  ans=ans+'-'+to_string(data[1]);
	}

	if(j==0){
	  sum+=data[2];
	  ans=ans+'+'+to_string(data[2]);
	}else{
	  sum-=data[2];
	  ans=ans+'-'+to_string(data[2]);
	}

	if(k==0){
	  sum+=data[3];
	  ans=ans+'+'+to_string(data[3]);
	}else{
	  sum-=data[1];
	  ans=ans+'-'+to_string(data[3]);
	}

	if(sum==7){
	  ans=ans+"=7";
	  cout<<ans<<endl;
	  return ;
	}
      }
    }
  }
}

int main(){
  string s;
  cin>>s;
  string_to_int(s);
  solve();
  return 0;
}