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
x = int(input())

#caso 1: x = 3k
#caso 2: x = 3k + 1
#caso 3: x = 3k + 2

if x%3 == 0:
    a = b = c = x//3
    if a%3 == 0:
        a -= 2
        b += 1
        c += 1
elif x%3 == 1:
    a = b = c = x//3
    #tem que somar mais 1
    if a%3 == 0:
        a -= 1
        b += 1
        c += 1
    elif a%3 == 1:
        c += 1
    else:
        b -= 1
        c += 2
else:
    a = b = c = x//3
    #tem que somar 2
    if a%3 == 0:
        a -= 1
        b += 1
        c += 2
    elif a%3 == 1:
        b += 1
        c += 1
    else:
        c += 2
    
print (a, b, c)
