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
i = { 
    (0,0): [-2, 1, 1], 
    (0,1): [ 0, 0, 0],
    (0,2): [ 0, 0, 0], 
    (1,0): [-1, 1, 1],
    (1,1): [ 0, 0, 1],
    (1,2): [-1, 0, 2],
    (2,0): [-1, 1, 2],
    (2,1): [ 0 ,1, 1],
    (2,2): [ 0, 0, 2]
}

n = int(input())
n_3 = n // 3
l = i[(n%3, n_3%3)]
print('{} {} {}'.format(n_3+l[0], n_3+l[1], n_3+l[2]))
