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())

e = n % 3
d = n / 3

m1 = m2 = m3 = d
dt = d % 3

if (e == 0): # 9
	if (dt == 0): # 3
		m1 = m1 + 1 # 4
		m2 = m2 + 1 # 4
		m3 = m3 - 2 # 1

elif (e == 1): # 10
	if (dt == 0): # n = 10; d = 3
		m1 = m1 + 1 # 4
		m2 = m2 + 1 # 4
		m3 = m3 - 1 # 2
	elif (dt == 1): # n = 13 => d = 4
		m1 = m1 + 1 # 5
		m2 = m2 # 4
		m3 = m3 # 4
	else: # n = 16 => d = 5
		m1 = m1 - 1 # 4
		m2 = m2 # 5
		m3 = m3 + 2 # 7

else: # 11
	if (dt == 0): # n = 11; d = 3
		m1 = m1 + 2 # 5
		m2 = m2 + 1 # 4
		m3 = m3 - 1 # 2
	elif (dt == 1): # n = 14 => d = 4
		m1 = m1 + 1 # 5
		m2 = m2 + 1 # 5
		m3 = m3 # 5
	else: # n = 17 => d = 5
		m1 = m1 + 2 # 7
		m2 = m2 # 7
		m3 = m3 # 4

print '%s %s %s' % (m1, m2, m3)