# Problem F

Önnur tilgáta Goldbachs

Languages
en
is
The integer $P$ is called prime if the only integers dividing it are $1$ and $P$ itself. As an example $20$ is not prime since it’s divisible by $5$. On the other hand $11$ is prime since only $1$ and $11$ divide $11$.

There is a famous conjecture about primes, Goldbach’s conjecture, which says:

All even integers greater than $2$ can be written as the sum of two primes.

This conjecture is from the year 1742. To this day no one has proved it nor found a counterexample. We considered making you prove it, but that would be too easy.

Instead we introduced a harder conjecture known as Goldbach’s second conjecture:

All odd numbers greater than $5$ can be written as the sum of three primes.

In this problem we provide the odd integer $N > 5$. We ask you to find three primes $P_1$, $P_2$ and $P_3$ such that $P_1 + P_2 + P_3 = N$ or to announce that $N$ is in violation of Goldbach’s second conjecture.

## Input

The input contains one odd integer $N > 5$.

## Output

Print three primes separated by spaces such that their sum
is $N$. If there are
several options you may print any of them. If no such primes
exist, instead print `Neibb`.

## Explanation of Sample Inputs

In the first sample $N =
65$. If you look at the output you can see that all of
the numbers are prime and have sum $65$. These could have been printed in
any order. Other possible solutions are `11
37 17` and `11 11 43`.

## Scoring

The solution will be tested on input data of varying difficulty and the data is divided into groups as shown in the table below. The solution will then be scored according to how many groups are solved.

Group |
Points |
Constraints |

1 |
20 |
$N \le 31$ |

2 |
25 |
$N \le 500$ |

3 |
25 |
$N \le 10^4$ |

4 |
30 |
$N \le 2 \cdot 10^8$ |

Sample Input 1 | Sample Output 1 |
---|---|

7 |
2 2 3 |

Sample Input 2 | Sample Output 2 |
---|---|

65 |
2 2 61 |