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 Pascal (FPC 2.6.2) (judge verdict: Wrong Answer)

var
  x1,x2,x3:char;
  i,j,k,n,s:longint;
begin
  readln(n);
  for i:=0 to 1 do
    for j:=0 to 1 do
      for k:=0 to 1 do
        begin
          s:=n div 1000;
          if i=0 then begin s:=s+n div 100 mod 10;x1:='+';end
            else begin s:=s-n div 100 mod 10;x1:='-';end;
          if j=0 then begin s:=s+n div 10 mod 10;x2:='+';end
            else begin s:=s-n div 10 mod 10;x2:='-';end;
          if k=0 then begin s:=s+n mod 10;x3:='+';end
            else begin s:=s-n mod 10;x3:='-';end;
          if s=7 then begin writeln(n div 1000,x1,n div 100 mod 10,x2,n div 10 mod 10,x3,n mod 10);exit;end;
        end;
end.