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 (GCC 5.4.1) (judge verdict: Time Limit Exceeded)

#include <stdio.h>

int main()
{
    int N,A[4],i,op[3],ans,j;

    scanf("%d",&N);
    for(i=3;i>=0;i--){
        A[i] = N % 10;
        N = N / 10;
    }
    for(i=0;i<3;i++)op[i]=0;

    while(1){
        ans = A[0];
        for(i=0;i<3;i++){
            if(op[i]==0) ans += A[i+1];
            else ans -= A[i+1];
        }
        if(ans == 7) break;
        if(op[0]==0){
            op[0] = 1;
        }else{
            for(i=1;i<3;i++){
                if(op[i] == 0){
                    op[i] = 1;
                    for(j=i-1;j>=0;j--){
                        op[j] = 0;
                    }
                }
            }
        }
    }

    printf("%d",A[0]);
    for(i=1;i<4;i++){
        if(op[i-1]==0){
            printf("+");
        }else{
            printf("-");
        }
        printf("%d",A[i]);
        if(i==3) printf("=7\n");
    }


    return 0;
    
}