from collections import Counter,defaultdict,deque

from heapq import heappop,heappush,heapify

from bisect import bisect_left,bisect_right 

import sys,math,itertools,fractions,pprint

sys.setrecursionlimit(10**8)

mod = 10**9+7

INF = float('inf')

def inp(): return int(sys.stdin.readline())

def inpl(): return list(map(int, sys.stdin.readline().split()))



a = list(eval(input()))

a = [int(i) for i in a]

for fl in itertools.product(list(range(2)),repeat=3):

    now = a[0]

    for i,x in enumerate(fl):

        if x:

            now += a[i+1]

        else:

            now -= a[i+1]

    if now == 7:

        L = str(a[0])

        for i,x in enumerate(fl):

            tmp = '+' if x else '-'

            L += tmp + str(a[i+1])

        print((L+'=7'))

        quit()

        
from collections import Counter,defaultdict,deque

from heapq import heappop,heappush,heapify

import sys,bisect,math,itertools,fractions

sys.setrecursionlimit(10**8)

mod = 10**9+7

INF = float('inf')

def inp(): return int(sys.stdin.readline())

def inpl(): return list(map(int, sys.stdin.readline().split()))



s = eval(input())

for pt in itertools.product([0,1],repeat=3):

    now = int(s[0])

    for i,x in enumerate(pt):

        # print(now)

        if x:

            now += int(s[i+1])

        else:

            now -= int(s[i+1])

    if now == 7:

        res = s[0]

        for i in range(1,4):

            tmp = '+' if pt[i-1] else '-'

            res += tmp + s[i]

        print((res+'=7'))

        break

    
from collections import Counter, defaultdict, deque
from heapq import heappop, heappush, heapify
from bisect import bisect_left, bisect_right
import sys, math, itertools, fractions, pprint

sys.setrecursionlimit(10**8)
mod = 10**9 + 7
INF = float("inf")


def inp():
    return int(sys.stdin.readline())


def inpl():
    return list(map(int, sys.stdin.readline().split()))


a = list(eval(input()))
a = [int(i) for i in a]
for fl in itertools.product(list(range(2)), repeat=3):
    now = a[0]
    for i, x in enumerate(fl):
        if x:
            now += a[i + 1]
        else:
            now -= a[i + 1]
    if now == 7:
        L = str(a[0])
        for i, x in enumerate(fl):
            tmp = "+" if x else "-"
            L += tmp + str(a[i + 1])
        print((L + "=7"))
        quit()

from collections import Counter, defaultdict, deque
from heapq import heappop, heappush, heapify
import sys, bisect, math, itertools, fractions

sys.setrecursionlimit(10**8)
mod = 10**9 + 7
INF = float("inf")


def inp():
    return int(sys.stdin.readline())


def inpl():
    return list(map(int, sys.stdin.readline().split()))


s = eval(input())
for pt in itertools.product([0, 1], repeat=3):
    now = int(s[0])
    for i, x in enumerate(pt):
        # print(now)
        if x:
            now += int(s[i + 1])
        else:
            now -= int(s[i + 1])
    if now == 7:
        res = s[0]
        for i in range(1, 4):
            tmp = "+" if pt[i - 1] else "-"
            res += tmp + s[i]
        print((res + "=7"))
        break

-from bisect import bisect_left, bisect_right -import sys, math, itertools, fractions, pprint +import sys, bisect, math, itertools, fractions -a = list(eval(input())) -a = [int(i) for i in a] -for fl in itertools.product(list(range(2)), repeat=3): -    now = a[0] -    for i, x in enumerate(fl): +s = eval(input()) +for pt in itertools.product([0, 1], repeat=3): +    now = int(s[0]) +    for i, x in enumerate(pt): +        # print(now) -            now += a[i + 1] +            now += int(s[i + 1]) -            now -= a[i + 1] +            now -= int(s[i + 1]) -        L = str(a[0]) -        for i, x in enumerate(fl): -            tmp = "+" if x else "-" -            L += tmp + str(a[i + 1]) -        print((L + "=7")) -        quit() +        res = s[0] +        for i in range(1, 4): +            tmp = "+" if pt[i - 1] else "-" +            res += tmp + s[i] +        print((res + "=7")) +        break