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 sys, math
from sys import stdin, stdout
rem =998244353
sys.setrecursionlimit(10 ** 6+5)
#from resource import *; setrlimit(RLIMIT_STACK, (RLIM_INFINITY, RLIM_INFINITY))
take = lambda: map(int, stdin.readline().split())
from heapq import heappush,heappop,heapify
from collections import deque
from bisect import *


n=input()
x=n/3

all=[x-3,x-2,x-1,x,x+1,x+2,x+3]*3
for a in all:
    for b in all:
        for c in all:
            if a%3!=0 and b%3!=0 and c%3!=0 and a>0 and b>0 and c>0 and a+b+c==n:
                print a,b,c
                exit()
