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

if n==3:
    print("1 1 1")
    exit(0)

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

elif n%3==1:
    k=n//3
    if k%3==0:
        print(k-1,k+1,k+1)
    elif k%3==1:
        print(k,k,k+1)
    else:
        print(k-1,k,k+2)

elif n%3==2:
    k=n//3
    if k % 3 == 0:
        print(k - 1, k + 1, k + 2)
    elif k % 3 == 1:
        print(k, k+1, k + 1)
    else:
        print(k , k, k + 2)
