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: Runtime Error)

#include<stdio.h>
void fun(int *p)
{
	int plus[8][3]={{1,1,1},{1,1,-1},{1-1,1},{1,-1,-1},{-1,1,1},{-1,1,-1},{-1,-1,1},{-1,-1,-1}};
	int i=0;
	for(i=0;i<8;i++)
	{
		if(p[0]+plus[i][0]*p[1]+plus[i][1]*p[2]+plus[i][2]*p[3]==7)
		break;
	}
	int j;
	for(j=0;j<3;j++)
	{
		if(plus[i][j]==1)plus[i][j]=0;
		else plus[i][j]=1;
	}
	char x[2]={'+','-'};
	printf("%d%c%d%c%d%c%d=7\n",p[0],x[plus[i][0]],p[1],x[plus[i][1]],p[2],x[plus[i][2]],p[3]);
}
int main()
{
	int a[4],n;
	while(scanf("%d",&n)!=EOF)
	{
		a[3]=n%10;
		n/=10;
		a[2]=n%10;
		n/=10;
		a[1]=n%10;
		n/=10;
		a[0]=n%10;
		fun(a);
	}
}