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
a = int(input())
if a%3 == 0:
    r1 =1
    r2=1
    r3=a-2
elif a%3 == 1:
    x1 = 1
    x2 = 1
    x3 = a-2
    if x3%3 == 0:
        r3 = a-3
        r1 = 1
        r2 = 2
    else:
        r3 = a-2
        r2 = 1
        r1 = 1
elif a % 3 ==2:
    y1 = 2
    y2 = 2
    y3 = a-4
    r1 = y1
    r2 = y2
    r3 = y3
print(r1,r2,r3)