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
'''input
3
'''
import sys
from collections import defaultdict as dd
from itertools import  permutations as pp
from itertools import combinations as cc
from collections import Counter as ccd
from random import randint as rd
from bisect import bisect_left as bl
import heapq
mod=10**9+7

def ri(flag=0):
	if flag==0:
		return [int(i) for i in input().split()]
	else:
		return int(input())

n=ri(1)
temp=n//3
rem=n%3

def check(a,b,c):
	if a%3!=0 and b%3!=0 and c%3!=0 and a+b+c==n and a>=0 and b>=0 and c>=0:
		return 1
	return 0

for i in  range(temp-3,temp+3):
	for j in range(temp-3,temp+3):
		for k in range(temp-3,temp+3):
			if check(i,j,k):
				print(i,j,k)
				sys.exit(0)
