Problem: 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. <image>



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.

Solution (in JAVA):

Solution:
import java.io.*;
import java.math.BigInteger;
import java.util.*;

import static java.lang.Math.*;

public class SolveContest {
    private BufferedReader in;
    private PrintWriter out;

    public SolveContest() {
        try {
            in = new BufferedReader(new FileReader("input.txt"));
            out = new PrintWriter(new FileWriter("output.txt"), true);
            solve();
        } catch (Exception e) {
            e.printStackTrace();
            in = new BufferedReader(new InputStreamReader(System.in));
            out = new PrintWriter(System.out);
            solve();
        } finally {
            try {
                in.close();
            } catch (IOException e) {

            }
            out.close();
        }
    }

    StringTokenizer st;

    String nextToken() {
        while (st == null || !st.hasMoreTokens())
            try {
                st = new StringTokenizer(in.readLine());
            } catch (IOException e) {

            }
        return st.nextToken();
    }

    int nextInt() {
        return Integer.valueOf(nextToken());
    }

    long nextLong() {
        return Long.valueOf(nextToken());
    }

    double nextDouble() {
        return Double.valueOf(nextToken());
    }

    long gcd(long a, long b) {
        return b == 0?a:gcd(b,a%b);
    }

    boolean prime(int n) {
        for (int i = 2; i*i <= n; i++) {
            if (n % i == 0) return false;
        }
        return true;
    }

    public void solve() {
        int n = nextInt();
        int s = 10000010;
        boolean[] prime = new boolean[s];
        Arrays.fill(prime, true);
        prime[1] = false;
        for (int i = 1; i < s; i++) {
            if (prime[i])
                if (1L*i*i < s) {
                    for (int j = i*i; j < s; j+=i) {
                        prime[j] = false;
                    }
                }
        }
        if (prime(n)) {
            out.println(1);
            out.print(n);
            return;
        }
        for(int i = 2; i < s;i++) {
            if (n > i && prime[i] && prime(n-i)) {
                out.println(2);
                out.print(i + " " + (n-i));
                return;
            }
        }
        for (int i = 2; i <= 5000; i++) {
            for (int j = i; j <= 5000; j++) {
                if (n > i+j && prime[i] && prime[j] && prime(n-i-j)) {
                    out.println(3);
                    out.println(i+" "+j+" "+(n-i-j));
                    return;
                }
            }
        }
    }

    class Pair implements Comparable<Pair>{
        int a;
        int b;

        Pair(int a, int b) {
            this.a = a;
            this.b = b;
        }

        @Override
        public int compareTo(Pair o) {
            if (a == o.a)
                return b-o.b;
            return a-o.a;
        }
    }

    public static void main(String[] args) {
        new SolveContest();
    }
}