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
import random
#import time
#start_time = time.time()

a = int(input())
b = 0
c = 0
d = 0
# if a % 3 == 0 and a == 3:
#     b = a // 3
#     c = a // 3
#     d = a // 3
#     print(b, c, d)
# else:
while (b + c + d) != a:
        b = random.randint(a // 3 - 1, (a // 3) + 10)
        c = random.randint(a // 3 - 2 , (a // 3) + 10)
        d = random.randint(a // 3 - 3, (a // 3) + 10)
        if b % 3 == 0 or c % 3 == 0 or d % 3 == 0 or not (b <= c <= d):
            b = c = d = 0
print(b, c, d)