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 math
import itertools
from sys import stdin
from functools import reduce
from collections import deque
from sys import setrecursionlimit
from collections import defaultdict
#setrecursionlimit(10**7)
input = stdin.readline
def I():return  int(input())
def IN():return map(int,input().split())
def LI():return list(map(int,input().split()))
def LIN(N):return [list(map(int,input().split())) for _ in range(N)]

def solve():
    n = I()
    if (n - 2) % 3 != 0:
        print(1, 1, n-2)
    else:
        print(1, 2, n-3)

def main():
    t = 1
    # t = I() 
    while t:
        t -= 1
        solve()
if __name__ == '__main__':
    main()