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 (Clang 3.8.0) (judge verdict: Wrong Answer)

#include <stdio.h>

int main(void){
   int i,t,seven[10],judge,j;
   int n[200];
   char en[3];
   scanf("%d", &t);
   for(i=0;i<4;i++){
    n[i] = t % 10;
    t /= 10;
   }
   seven[0] = n[0]+n[1]+n[2]+n[3];
   seven[1] = n[0]-n[1]+n[2]+n[3];
   seven[2] = n[0]+n[1]-n[2]+n[3];
   seven[3] = n[0]-n[1]-n[2]+n[3];
   seven[4] = n[0]+n[1]+n[2]-n[3];
   seven[5] = n[0]-n[1]+n[2]-n[3];
   seven[6] = n[0]+n[1]-n[2]-n[3];
   seven[7] = n[0]-n[1]-n[2]-n[3];
   for(i=0; i<8;i++){
    if(seven[i] == 7){
        judge = i;
        for(j=0;j<3;j++){
        en[j] = judge %2;
        judge /= 2;
        if(en[j] == 0){
            en[j] = '+';
        }
        else{
            en[j] = '-';
               }
        }
    }
   }
   printf("%d%c%d%c%d%c%d=7\n", n[3],en[2],n[2],en[1],n[1],en[0],n[0]);
   return 0;
}