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<cstdio>
#include<cstdlib>
#include<algorithm>
#include<iostream>
#include<queue>
#include<vector>
using namespace std;
#define MAX 120
typedef long long ll;

int data,a[4],k=3,ans[4];
bool flag=true;

void solve(int count,int num){
  if(count==4 && flag){
    flag=false;
    if(num==0){
      for(int i=0;i<3;i++){
        cout<<a[i];
        if(ans[i]==1) cout<<"+";
        else cout<<"-";
      }
      cout<<a[3]<<"=7"<<endl;
      return;
    }else return;
  }
  ans[count-1]=1;
  solve(count+1,num-a[count]);
  ans[count-1]=0;
  solve(count+1,num+a[count]);
}

int main(){
  cin>>data;
  while(data!=0){
    a[k--]=data%10;
    data/=10;
  }
  solve(1,7-a[0]);
}