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
# -*- coding: utf-8 -*-
"""
Created on Fri Feb 14 19:51:59 2020

@author: Lenovo
"""


#https://codeforces.com/problemset/problem/1047/A


def love_3():
    number = int(input())
    
    if number == 3:
        print(1, 1, 1)
        return
    
    temp = number
    others = 0
    
    while True:
        temp -= 2
        others += 1
        if temp % 3 != 0:
            print(temp, others, others)
            return
    
love_3()