def isprime(x):
    if x==1:
        return False
    for i in range(2,int(x/2)+1):
        if x%i==0:
            return False
    return True
n=int(input())
v=[]
def backrec(k,vect):
    global n
    for i in range(k,n):
        if sum(vect)+i>n:
            return
        if isprime(i):
            if sum(vect)+i<=n:
                vect.append(i)
                if sum(vect)==n:
                    #print(vect)
                    return
                    #print(vect)
                else:
                    backrec(k,vect)
                    vect.pop()
backrec(2,v)