Description

Now please write a program to verify Goldbach's conjecture.

Given an odd number $n$, output $3$ primes whose sum equals the input odd number.

Input Format

Only one line, containing a positive odd integer $n$, where $9 < n < 20000$.

Output Format

Only one line, output $3$ primes whose sum equals the input odd number. Adjacent primes are separated by a single space, and there is no space after the last prime. If the representation is not unique, output the scheme with the smallest first prime. If there are multiple such schemes, output the one that also has the smallest second prime.

2009

3 3 2003

Hint

Translated by ChatGPT 5