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(k) for k in raw_input().split(" ")][0]

n9=n/9
m=n%9

t=[n9*3]*3

if m==0:
    t[0]+=2
    t[1]-=1
    t[2]-=1
if m==1:
    t[0]+=1
    t[1]+=1
    t[2]-=1
if m==2:
    t[0]+=2
    t[1]+=1
    t[2]-=1
if m==3:
    t[0]+=1
    t[1]+=1
    t[2]+=1
if m==4:
    t[0]+=2
    t[1]+=1
    t[2]+=1
if m==5:
    t[0]+=2
    t[1]+=2
    t[2]+=1
if m==6:
    t[0]+=2
    t[1]+=2
    t[2]+=2
if m==7:
    t[0]+=4
    t[1]+=2
    t[2]+=1
if m==8:
    t[0]+=4
    t[1]+=2
    t[2]+=2

print t[0],t[1],t[2]
