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())
p = int(n/3)
r = []
if n % 3 == 0:
  if p % 3 == 0:
    r.append(p - 1)
    r.append(p - 1)
    r.append(p + 2)
  else:
    r.append(p)
    r.append(p)
    r.append(p)
elif n % 3 == 1:
  if p % 3 == 0:
    r.append(p + 1)
    r.append(p + 1)
    r.append(p - 1)
  elif (p + 1) % 3 == 0:
    r.append(p)
    r.append(p - 1)
    r.append(p + 2)
  else:
    r.append(p)
    r.append(p)
    r.append(p + 1)
elif n % 3 == 2:
  if p % 3 == 0:
    r.append(p - 1)
    r.append(p - 1)
    r.append(p + 4)
  elif (p + 2) % 3 == 0:
    r.append(p + 1)
    r.append(p + 1)
    r.append(p)
  else:
    r.append(p)
    r.append(p)
    r.append(p + 2)
print("{} {} {}".format(r[0], r[1], r[2]))
		     		   	  	      		 		 		