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.

S=input()
print(S[0])
show=""
def dfs(op):
    if len(op)==3:
        count=int(S[0])
        for i in range(3):
            if op[i]=='+':
                count+=int(S[i+1])#b c d
            elif op[i]=='-':
                count-=int(S[i+1])
        if count==7:
            show=S[0]
            for i in range(3):
                show+=op[i]+S[i+1]
            show+="=7"
            return show
        else:
            return ""
    s1=dfs(op+'+')
    s2=dfs(op+'-')
    if len(s1)>len(s2):
        return s1
    else:
        return s2

print(dfs(""))
import sys, re, os
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import permutations, combinations, product, accumulate
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from heapq import heapify, heappop, heappush

def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def S_MAP(): return map(str, input().split())
def LIST(): return list(map(int, input().split()))
def S_LIST(): return list(map(str, input().split()))
 
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

M = list(input())

S = [int(s) for s in M]
L = [0, 1] 
num = 3 
bit_list = list(product(["+", "-"], repeat=num))

tmp = 0
for b in bit_list:
    ans = 0
    # print(b)
    for i, o in enumerate(b):
        # print("I", o)
        if o == "+":
            if i == 0:
                ans = S[i] + S[i+1]
            else:
                ans += S[i+1]
        else:
            if i == 0:
                ans = S[i] - S[i+1]
            else:
                ans -= S[i+1]
    # print(ans)
    if ans == 7:
        tmp = b
        break
ans = ""
for i, c in enumerate(tmp):
    ans += M[i]
    ans += c
ans += M[-1] + "=7"
print(ans)

