
# slower version:

s = input()
for i in range(len(s)):
  if i%2 == 0:
    print(s[i], end = '')


# optimized version of the same code:

s = input()
ans = ''
for i in range(len(s)):
  if i % 2 == 0:
    ans += s[i]
print(ans)



# slower version:

import numpy as np

num=np.array(list(eval(input())))



for bit in  range(1<<3):

  op=np.array(['-']*3)

  for i in range(3):

    if (bit>>i)&1:

      op[i]='+'

  formula=np.insert(num,[1,2,3],op)

  

  if eval(''.join(formula))==7:

    flag=True

    print((''.join(formula)+'=7'))

    break

# optimized version of the same code:

INF = 10 ** 9

import sys

sys.setrecursionlimit(100000000)

dy = (-1,0,1,0)

dx = (0,1,0,-1)

from  heapq import heappop,heapify,heappush

from bisect import bisect_left



def main():

    s = eval(input())

    for bit in range(8):

        op = []

        for i in range(3):

            if (bit>>i)&1:

                op.append('+')

            else:

                op.append('-')

        

        tmp = s[0]

        for i in range(3):

            tmp += op[i]

            tmp += s[i + 1]



        if eval(tmp) == 7:

            ans = tmp + '=7'

            break

    print(ans)

if __name__ == '__main__':

    main()

import numpy as np

num = np.array(list(eval(input())))
for bit in range(1 << 3):
    op = np.array(["-"] * 3)
    for i in range(3):
        if (bit >> i) & 1:
            op[i] = "+"
    formula = np.insert(num, [1, 2, 3], op)
    if eval("".join(formula)) == 7:
        flag = True
        print(("".join(formula) + "=7"))
        break

INF = 10**9
import sys

sys.setrecursionlimit(100000000)
dy = (-1, 0, 1, 0)
dx = (0, 1, 0, -1)
from heapq import heappop, heapify, heappush
from bisect import bisect_left


def main():
    s = eval(input())
    for bit in range(8):
        op = []
        for i in range(3):
            if (bit >> i) & 1:
                op.append("+")
            else:
                op.append("-")
        tmp = s[0]
        for i in range(3):
            tmp += op[i]
            tmp += s[i + 1]
        if eval(tmp) == 7:
            ans = tmp + "=7"
            break
    print(ans)


if __name__ == "__main__":
    main()

-import numpy as np +INF = 10**9 +import sys -num = np.array(list(eval(input()))) -for bit in range(1 << 3): -    op = np.array(["-"] * 3) -    for i in range(3): -        if (bit >> i) & 1: -            op[i] = "+" -    formula = np.insert(num, [1, 2, 3], op) -    if eval("".join(formula)) == 7: -        flag = True -        print(("".join(formula) + "=7")) -        break +sys.setrecursionlimit(100000000) +dy = (-1, 0, 1, 0) +dx = (0, 1, 0, -1) +from heapq import heappop, heapify, heappush +from bisect import bisect_left + + +def main(): +    s = eval(input()) +    for bit in range(8): +        op = [] +        for i in range(3): +            if (bit >> i) & 1: +                op.append("+") +            else: +                op.append("-") +        tmp = s[0] +        for i in range(3): +            tmp += op[i] +            tmp += s[i + 1] +        if eval(tmp) == 7: +            ans = tmp + "=7" +            break +    print(ans) + + +if __name__ == "__main__": +    main()