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: Wrong Answer)

#include <stdio.h>

void seven (int Num[], int goal) {
  int i;
  for(i = 0; i < 3; i++) {
    if (goal - Num[i] < 0) {
      Num[i] = -Num[i];
      goal = Num[i] - goal;
    }
    else
      goal -= Num[i];
  }

}

int main () {
  int n;
  int i,j,tmp;
  int num[4];

  scanf("%d",&n);

  num[3] = n / 1000;
  num[2] = (n % 1000) / 100;
  num[1] = (n % 100) / 10;
  num[0] = n % 10;

  seven(num,7);

  for (i = 0; i < 3; i++) {
    for (j = i; j < 4; j++) {
      if (num[i] < num[j]) {
        tmp = num[i];
        num[i] = num[j];
        num[j] = tmp;
      }
    }
  }

  printf("%d",num[0]);

  for (i = 1; i < 4; i++) {
    if (num[i] >= 0) {
      printf("+%d",num[i]);
    }
    else {
      printf("%d",num[i]);
    }
  }

  putchar('\n');

  return 0;
}