def is_prime(n):
    if n < 2 :
        return False
    if n == 2 :
        return True
    if n % 2 == 0:             
        return False
    div = 3                         
    while div * div <= n:      
        if n % div == 0:
            return False
        else:
            div += 2
    return True


while 1:
    first = int(input("请输入一个大于等于4的偶数："))
    if first < 4 or first % 2 != 0:
        print("你的输入有误，请重新输入。\n")
    else:
        break

       
N = 10
if first == 4:
    print("4 : 2 + 2")                  
    N -= 1
    first = 6
for i in range(N):
    even_num = first + 2 * i
    print(even_num, ": ", end="")
    j = 3
    while j <= even_num//2 :                
        if is_prime(j) and is_prime(even_num - j):
            print(j, "+", even_num - j)
            break
        j += 2
    if j > even_num//2 :             
        print(even_num, "：没找到'1+1'结构，恭喜你推翻了哥德巴赫猜想！！！")