import itertools, re



abcd = eval(input())

abcd = [int(x) for x in abcd]

p = list(itertools.product([1,-1], repeat=3))



f = abcd[0]

fs = str(abcd[0])

for i in range(len(p)):

  for j in range(3):

    f += abcd[j+1]*p[i][j]

    if p[i][j] <0:

      fs += '-' + str(abcd[j+1])

    else:

      fs += '+' + str(abcd[j+1])

  if f == 7:

    print((fs + '=7'))

    exit()

  else:

    f = abcd[0]

    fs = str(abcd[0])

abcd = eval(input())





def dfs(i, f, sum):

  if i == 3:

    if sum ==7:

      print((f + '=7'))

      exit()

    

  else:

    dfs(i+1, f + '+' + abcd[i+1], sum + int(abcd[i+1]))

    dfs(i+1, f + '-' + abcd[i+1], sum - int(abcd[i+1]))





dfs(0, abcd[0], int(abcd[0]))
import itertools, re

abcd = eval(input())
abcd = [int(x) for x in abcd]
p = list(itertools.product([1, -1], repeat=3))
f = abcd[0]
fs = str(abcd[0])
for i in range(len(p)):
    for j in range(3):
        f += abcd[j + 1] * p[i][j]
        if p[i][j] < 0:
            fs += "-" + str(abcd[j + 1])
        else:
            fs += "+" + str(abcd[j + 1])
    if f == 7:
        print((fs + "=7"))
        exit()
    else:
        f = abcd[0]
        fs = str(abcd[0])

abcd = eval(input())


def dfs(i, f, sum):
    if i == 3:
        if sum == 7:
            print((f + "=7"))
            exit()
    else:
        dfs(i + 1, f + "+" + abcd[i + 1], sum + int(abcd[i + 1]))
        dfs(i + 1, f + "-" + abcd[i + 1], sum - int(abcd[i + 1]))


dfs(0, abcd[0], int(abcd[0]))

-import itertools, re +abcd = eval(input()) -abcd = eval(input()) -abcd = [int(x) for x in abcd] -p = list(itertools.product([1, -1], repeat=3)) -f = abcd[0] -fs = str(abcd[0]) -for i in range(len(p)): -    for j in range(3): -        f += abcd[j + 1] * p[i][j] -        if p[i][j] < 0: -            fs += "-" + str(abcd[j + 1]) -        else: -            fs += "+" + str(abcd[j + 1]) -    if f == 7: -        print((fs + "=7")) -        exit() + +def dfs(i, f, sum): +    if i == 3: +        if sum == 7: +            print((f + "=7")) +            exit() -        f = abcd[0] -        fs = str(abcd[0]) +        dfs(i + 1, f + "+" + abcd[i + 1], sum + int(abcd[i + 1])) +        dfs(i + 1, f + "-" + abcd[i + 1], sum - int(abcd[i + 1])) + + +dfs(0, abcd[0], int(abcd[0]))