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: Accepted)

#include<stdio.h>
#include<stdlib.h>
int add(int a,int b)
{
	return a+b;
}
int minus(int a,int b)
{
	return a-b;
}
void sign(int a)
{
	if(a)
	{
		printf("-");
	}
	else
	{
		printf("+");
	}
}
int main()
{
	int a[4];int b[3];
	char input[5];
	int (*op[2])(int a,int b);
	op[0]=add;
	op[1]=minus;
	int i,j,k,l;
	while(scanf("%s",input)!=-1)
	{
		for(i=0;i<4;i++)
		{
			a[i]=input[i]-48;
		}								//输入
		int count=0;
		for(i=0;i<=1;i++)
		{
			for(j=0;j<=1;j++)
			{
				for(k=0;k<=1;k++)
				{
					b[0]=op[i](a[0],a[1]);
					b[1]=op[j](b[0],a[2]);
					b[2]=op[k](b[1],a[3]);
					if(b[2]==7)
					{
						count++;
						break;
					}
					
				}
				if(count>0)break;
			}
			if(count>0)break;
		} 
		printf("%c",input[0]);
		sign(i);
		printf("%c",input[1]);
		sign(j);
		printf("%c",input[2]);
		sign(k);
		printf("%c=7\n",input[3]);
	}
}