Little C loves number «3» very much. He loves all things about it.

Now he has a positive integer n. He wants to split n into 3 positive integers a,b,c, such that a+b+c=n and none of the 3 integers is a multiple of 3. Help him to find a solution.

Input

A single line containing one integer n (3 ≤ n ≤ 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.

Examples

Input

3


Output

1 1 1

Input

233

Output

77 77 79
'''
The idea to solve this problem is by keeping the a, b constant while c
is set accordingly to a & b. Notice that a, b, c could be any positive integer
(larger than 0) as long as a + b + c = n & none of a, b, or c is divisible by 3.

So if we set a = 1, b = 1, we could see that c = n - 2, but notice that
c might be divisible by 3. So the solution is, if (n - 2) is divisible by 3
then we use another formula which is a = 1, b = 1 + 1 = 2, c = n - 2 - 1 = n - 3.

The reason why we are able to do this is because if c is divisible by 3 in a
formula, it cannot divisible by 3 in another formula because it is already decremented
by 1.
'''

n = int(input())

if ((n-2) % 3 == 0):
    print(1, 2, n-3)
else:
    print(1, 1, n-2)