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(raw_input())
t=n/3
rem=n%3
temp=t+rem
if t%3!=0 and rem==0:
    print t,t,t
elif t%3!=0 and rem==1 and (t+rem)%3!=0:
    print t,t,t+1
elif t%3!=0 and rem==1 and (t+rem)%3==0:
    print t-1,t-1,t+3
elif t%3!=0 and rem==2 and (t+rem)%3==0:
    print t,t+1,t+1
elif t%3!=0 and rem==2 and (t+rem)%3!=0:
    print t,t,t+2
elif t%3==0 and rem==0:
    print t-1,t-1,t+2
elif t%3==0 and rem==1:
    print t-1,t+1,t+1
elif t%3==0 and rem==2:
    print t-1,t+1,t+2
