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.
def solve(A,n):
    x=2**n
    for i in range(x):
        count=A[0]
        for j in range(n):
            if (i>>j) & 1:
                count+=A[j+1]
            else:
                count-=A[j+1]
        if count==7:
            return i

n=3
A=list(map(int,input()))
i=solve(A,n)
ans=str(A[0])
for j in range(n):
    if (i>>j) & 1:
        ans+="+"+str(A[j])
    else:
        ans+="-"+str(A[j])
ans+="=7"
print(ans)
    
def solve(A,n):
    x=2**n
    for i in range(x):
        count=A[0]
        for j in range(n):
            if (i>>j) & 1:
                count+=A[j+1]
            else:
                count-=A[j+1]
        if count==7:
            return i

n=3
A=list(map(int,input()))
i=solve(A,n)
ans=str(A[0])
for j in range(n):
    if (i>>j) & 1:
        ans+="+"+str(A[j+1])
    else:
        ans+="-"+str(A[j+1])
ans+="=7"
print(ans)