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 PyPy3 (2.4.0) (judge verdict: Accepted)

from __future__ import print_function
# import numpy as np
# import numpypy as np
import sys
input = sys.stdin.readline

def eprint(*args, **kwargs):
    print(*args, file=sys.stderr, **kwargs)
    return

# import math
# import string
# import fractions
# from fractions import Fraction
# from fractions import gcd

# def lcm(n,m):
#     return int(n*m/gcd(n,m))

# import re
# import array
# import copy
# import functools
# import operator

# import collections
# import itertools
# import bisect
# import heapq


# from heapq import heappush
# from heapq import heappop
# from heapq import heappushpop
# from heapq import heapify
# from heapq import heapreplace

# from queue import PriorityQueue as pq

# def reduce(p, q):
#     common = fractions.gcd(p, q)
#     return (p//common , q//common )
# # from itertools import accumulate
# # from collections import deque

# from operator import mul
# from functools import reduce

# def combinations_count(n, r):
#     r = min(r, n - r)
#     numer = reduce(mul, range(n, n - r, -1), 1)
#     denom = reduce(mul, range(1, r + 1), 1)
#     return numer // denom

# import random


def main():
    # a,b,c,d = map(int, input().strip().split())
    l_abcd = list(map(int,input().strip()))
    eprint("l_abcd ",end=": ")
    eprint(l_abcd)
    for case in range(2 ** 3):     # 場合ループ # nは人とかモノとかの個数
        l_op_bin = list(map(int,(format(case,'b').zfill(3))))
        # eprint("l_op_bin ",end=": ")
        # eprint(l_op_bin)
        
        #flag=0
        sum_x=l_abcd[0]
        l_op=[]
        for index_location in range(3):      # 人とかモノとかループ
            if l_op_bin[index_location]==1:                   # その桁がyesだと仮定している場合
               sum_x += l_abcd[1+index_location]
               l_op.append("+")
            else:                                 # その桁がnoだと仮定している場合
               sum_x -= l_abcd[1+index_location]
               l_op.append("-")
        if sum_x==7:
            print(l_abcd[0], end="")
            print(l_op[0],end="")
            print(l_abcd[1], end="")    
            print(l_op[1],end="")
            print(l_abcd[2], end="")    
            print(l_op[2],end="")
            print(l_abcd[3], end="=7\n")
            return
if __name__ == '__main__':
    main()