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 rep(i,n) for(int i=0; i<(n); i++)
using ll = long long;
#define int long long
using P = pair<int,int>;
int a,b,c,d;
int num[4];
char hoge[2] = {'+','-'};
int calc(int i,int j,int k){
    int p[3] = {i,j,k};
    int res = a;
    
    rep(x,3){
        if(p[x] == 0){
            res += num[x+1];


        }
        else {
            res -= num[x+1];

        }
        
    }
    return res;
}
signed main(){
    string s;cin >> s;
    
    a = s[0] - '0';
    b = s[1] - '0';
    c = s[2] - '0';
    d = s[3] - '0';
    num[0] = a;
    num[1] = b;
    num[2] = c;
    num[3] = d;
    rep(i,2)rep(j,2)rep(k,2){
        
        if(calc(i,j,k) == 7){
            cout << a << hoge[i] << b << hoge[j] << c << hoge[k] << d << "=7" << endl;
            return 0;

        }
    }
    return 0;
}