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 Java8 (OpenJDK 1.8.0) (judge verdict: Accepted)

import java.util.*;

class Main {
  public static void main(String[] args) {
    Scanner sc = new Scanner(System.in);
    int N = sc.nextInt();
    int A = N / 1000;
    int B = (N % 1000) / 100;
    int C = (N % 100) / 10;
    int D = N % 10;
    String op[] = {"+", "+", "+"};
    if (A + B + C + D != 7) {
      if (A + B + C - D == 7) {
        op[2] = "-";
      } else if (A + B - C + D == 7) {
        op[1] = "-";
      } else if (A + B - C - D == 7) {
        op[1] = "-";
        op[2] = "-";
      } else {
        op[0] = "-";
        if (A - B + C + D != 7) {
          if (A - B + C - D == 7) {
            op[2] = "-";
          } else if (A - B - C + D == 7) {
            op[1] = "-";
          } else {
            op[1] = "-";
            op[2] = "-";
          }
        }
      }
    }
    System.out.println(A + op[0] + B + op[1] + C + op[2] + D + "=7");
  }
}