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 and a%9 != 0):
    p = q = r = (a/3)

elif (a%3 == 0 and a%9 == 0):
    p = (a/3)+2
    q = (a/3)-1
    r = (a/3)-1

elif (a%3 == 1 and ((a-1)%9 != 0)):
    p = ((a-1)/3)
    x = (p%3)
    if (x == 0):
        q = p+2
        r = p-1
    elif (x == 1):
        q = p+1
        r = p
    elif (x == 2):
        q = p+2
        r = p-1
        
elif (a%3 == 1 and ((a-1)%9 == 0)):
    p = ((a-1)/3)+2
    q = ((a-1)/3)+1
    r = ((a-1)/3)-2

elif (a%3 == 2 and ((a-2)%9 != 0)):
    p = ((a-2)/3)
    if (p%3 == 1):
        r = p+1
        q = p+1
        
    else:
        q = p+3
        r = p-1

elif (a%3 == 2 and ((a-2)%9 == 0)):
    p = ((a-2)/3)+2
    q = ((a-2)/3)+1
    r = ((a-2)/3)-1
    
print (int(p), int(q), int(r))