import math
def is_Prime(n):
    if n==2:
        return 1
    for i in range(2,int(math.sqrt(n)+1)):
        if n%i==0:
            return 0
    return 1
list_Prime = []
for i in range (2,10001):
    if is_Prime(i) == 1:
        list_Prime.append(i)
# print(list_Prime)
num = int(input())
end_print = 0
for i in range(4,num+1,2):
    # print(i)
    for j in list_Prime:
        if j>i/2 :
            break
        for k in list_Prime:
            if k >= i:
                break
            if j+k == i:
                print(f"{i}={j}+{k}")
                end_print = 1
                if end_print == 1:
                    break
        if end_print == 1:
            end_print = 0
            break