Dima and Lisa

这是一道初等数论的题。特别注意的是题目中说了给的数一定是个基数（自己英语太渣）首先我们知道的是它最多只能分解成3个素数的和，所以我们只需要分别考虑分成一个数两个数三个数的情况。分成一个数就只能是它自己是个素数。如果分成两个数，那么只能是一个奇数一个偶数，偶数是素数的就只有2，判断n-2就ok，分成3个数的话，有可能是3个奇数或者说一个奇数两个2，注意，素因子分解中两个素数最大距离不超过300，看了大佬的代码才知道的。

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cmath>
using namespace std;
int n;
int prim(int n)
{
    if(n==3||n==5||n==7)  return 1;
    if(n%2==0||n%3==0||n%5==0||n%7==0) return 0;
    for(int i=7;i<=sqrt(n);i++)
    {
        if(n%i==0)
            return 0;
    }
    return 1;
}
int main()
{
    int i,j,k,index;
    scanf("%d",&n);
    if(prim(n))
    {
        printf("1\n%d\n",n);
    }
    else
    {
        if(prim(n-2))
        {
            printf("2\n2 %d\n",n-2);
        }
        else
        {
            if(prim(n-4))
            {
                printf("3\n2 2 %d\n",n-4);
            }
            else
            {
                for(i=n-3;i>=n-300;i--)
                {
                    if(i<1) break;
                    if(prim(i))
                    {
                        index=i;
                        break;
                    }
                }
                k=n-i;
                if(prim(k))
                {
                    printf("2\n%d %d\n",index,k);
                }
                else
                {
                    for(i=2;i<=k;i++)
                    {
                        if(prim(i)&&prim(k-i))
                        {
                            printf("3\n%d %d %d\n",index,i,k-i);
                            break;
                        }
                    }
                }
            }
        }
        return 0;
    }
}

 

 

Dima loves representing an odd number as the sum of multiple primes, and Lisa loves it when there are at most three primes. Help them to represent the given number as the sum of at most than three primes.

More formally, you are given an odd numer n. Find a set of numbers pi (1 ≤ i ≤ k), such that

1. 1 ≤ k ≤ 3
2. pi is a prime
3. 

The numbers pi do not necessarily have to be distinct. It is guaranteed that at least one possible solution exists.

Input

The single line contains an odd number n (3 ≤ n < 109).

Output

In the first line print k (1 ≤ k ≤ 3), showing how many numbers are in the representation you found.

In the second line print numbers pi in any order. If there are multiple possible solutions, you can print any of them.

Examples

Input

27

Output

3
5 11 11

Note

A prime is an integer strictly larger than one that is divisible only by one and by itself.