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

number = int(input())

number1 = random.randint(0, number)
if number1 % 3 == 0:
    number1 += 1

number2 = random.randint(0, number - number1)
if number2 % 3 == 0:
    number2 += 1

number3 = number - number1 - number2
if number3 % 3 == 0 or number3 < 0:
    number1 = 1
    number2 = 1
    number3 = number - 2
    if number3 % 3 == 0:
       number3 -= 1
       number1 += 1


print(number1, number2, number3)

