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 "bits/stdc++.h"
using namespace std;

//

#define RESIDUE(u,v) (capacity[u][v] - flow[u][v])
#define RCOST(u,v) (cost[u][v] + h[u] - h[v])
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n)   FOR(i,0,n)
#define LL long long

char op1,op2,op3;

int main(){
  int n;
  cin>>n;
  int m=0;
  int a = n/1000;
  n=n%1000;
  int b = n/100;
  n=n%100;
  int c = n/10;
  int d=n%10;
  REP(i,2){
    REP(j,2){
      REP(k,2){
	m=a;
	m+=(i==0)?b:(-b);
	m+=(j==0)?c:(-c);
	m+=(k==0)?d:(-d);
	if(m==7){
	  op1=(i==0)?'+':'-';
	  op2=(j==0)?'+':'-';
	  op3=(k==0)?'+':'-';
	}
      }
    }
  }
  cout<<a<<op1<<b<<op2<<c<<op3<<d<<"=7"<<endl;;
  return 0;
}