Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ICPC mode for virtual contests.
If you've seen these problems, a virtual contest is not for you - solve these problems in the archive.
If you just want to solve some problem from a contest, a virtual contest is not for you - solve this problem in the archive.
Never use someone else's code, read the tutorials or communicate with other person during a virtual contest.

No tag edit access

The problem statement has recently been changed. View the changes.

×
D. Dima and Lisa

time limit per test

1 secondmemory limit per test

256 megabytesinput

standard inputoutput

standard outputDima 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 *p*_{i} (1 ≤ *i* ≤ *k*), such that

- 1 ≤
*k*≤ 3 -
*p*_{i}is a prime

The numbers *p*_{i} 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* < 10^{9}).

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 *p*_{i} 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.

Codeforces (c) Copyright 2010-2021 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: May/09/2021 14:22:40 (j2).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|