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

m = n/3
x = int(m)
y = 0
z = 0

if x%3 == 0:
    x = x - 1

n = n - x

if n%2:
    y = int(n/2)
    z = int(n/2) + 1               
else:
    y = z = n/2


if y%3 == 0 or  z%3 == 0:
    y = y - 1
    z = z + 1

list = [x, int(y), int(z)]
list.sort()

x, y, z = list[0], list[1], list[2]
print(x, ' ',y, ' ', z)

#######################################################################################

# n = int(input())
# sum = -1

# for i in range(n):
#     m, n = map(int, input().split())
#     m = int(m)
#     n = int(n)
#     if m+n > sum:
#         sum = m+n

# print(sum)

#########################################################################################

# n = int(input())

# num = list(map(int, input().split()))

# num.sort()

# x = num[0]
# count = 0

# for i in range(n):
#     if num[i] == x:
#         count += 1

# if count == n:
#     print("-1")
# else:
#     print(count)
