def is_prime(n):
    for i in range(2, n):
        if n % i == 0:
            return False
    return True


def conjecture():
    n = int(input())
    conj = []
    for i in range(4, n+1):
        if i % 2 == 0:
            for j in range(2, i // 2 + 1):
                if is_prime(j) and is_prime(i-j):
                    conj.append("{:}".format(i) + "=" + "{:}".format(j) + "+" + "{:}".format(i-j))
                    break
    for i in conj:
        print(i)


conjecture()