Little C Loves 3 I

Description:

Input:

A single line containing one integer $$$n$$$ ($$$3 \leq n \leq 10^9$$$) — the integer Little C has.

Output:

Print $$$3$$$ positive integers $$$a,b,c$$$ in a single line, such that $$$a+b+c=n$$$ and none of them is a multiple of $$$3$$$.

It can be proved that there is at least one solution. If there are multiple solutions, print any of them.

Sample Input:

3

Sample Output:

1 1 1

Sample Input:

233

Sample Output:

77 77 79