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
numero = int(input())
na = 0
nb = 0
nc = 0
if numero % 3 != 0:
  na = int(numero/3) + numero%3
  nb = int(numero/3)
  nc = int(numero/3)
else:
  na = int(numero/3)
  nb = int(numero/3)
  nc = int(numero/3)
while (na%3 == 0) or (nb%3 == 0) or (nc%3 == 0):
  na -=1
  nb -=1
  nc +=2
if numero == 5:
  na = 2
  nb = 2
  nc = 1
print(str(na) + " " + str(nb) + " " + str(nc))

	 	 	  	   	  			  		 	 				