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 9.2.1) (judge verdict: Accepted)

#include<stdio.h>
#include<string.h>
#include<stdlib.h>
#include<math.h>
#define PI 3.141592653589793
#define MOD 1000000007
//#define DEBUG

char numbers[8];
char op[8];
char ans[16];

//qsort用、昇順
int compare_int(const void *a, const void *b)
{
	return *(int*)a-*(int*)b;
}
//qsort(array, 10, sizeof(int), compare_int)

void search(int opnum)
{
	if(opnum == 3){
		int terms[8], sum=0;
		for(int i=0; i<4; i++){
			terms[i] = numbers[i] - '0';
		}
		sum += terms[0];
		for(int i=0; i<3; i++){
			if(op[i] == '+') sum += terms[i+1];
			else sum -= terms[i+1];
		}

		if(sum == 7){
			int j=1;
			ans[0] = terms[0] + '0';
			for(int i=0; i<3; i++){
				ans[j] = op[i];
				j++;
				ans[j] = terms[i+1] + '0';
				j++;
			}
		}
		return;
	}

	op[opnum] = '+';
	search(opnum+1);
	op[opnum] = '-';
	search(opnum+1);

	return;
}

int main(){
	scanf("%s", numbers);

	search(0);

	printf("%s=7\n", ans);
	
	return 0;
}