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 \leq n \leq 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

Difficulty: interview

Starter code:

Solutions:
n = int(input())
if n%3 == 0: print(1, 1, n-2)
elif n%3 == 1: print(1, 1, n-2)
else: print(1, 2, n-3)

n = int(input())
if n%3==2:
    print(1,2,n-3)
else:
    print(1,1,n-2)


n=int(input())
if(n%3!=2):
    print(1,1,n-2)
else:
    print(1,2,n-3)

n = int(input())


if n %3 == 0:
    print(n - 2, 1, 1)

if n % 3 == 1:
    print(n - 2, 1, 1)
if n % 3 == 2:
    print(n - 3, 2, 1)



n = int(input())
if n % 3 == 2:
    print(1, 2, n - 3)
else:
    print(1, 1, n - 2)


n = int(input())
if (n-2)%3==0:
    print(1,2,n-3)
else:
    print(1,1,n-2)

n = int(input())
if not (n - 2) % 3:
    print(1, 2, n - 3)
else:
    print(1, 1, n - 2)

# import sys
# sys.stdin = open("F:\\Scripts\\input","r")
# sys.stdout = open("F:\\Scripts\\output","w")

MOD = 10**9 + 7
I = lambda:list(map(int,input().split()))

n, = I()
if (n-2)%3 == 0:
	print(1,2,n-3)
	return
print(1,1,n-2)


n = int(input())
a = 1
if (n - 2) % 3 != 0:
    print(1, 1, n - 2)
else:
    if (n - 3) % 3 != 0:
        print(1, 2, n - 3)
    else:
        print(1, 3, n - 4)

import os
import sys

n = int(sys.stdin.readline())

if n % 3 != 2:
    sys.stdout.write("{0} {1} {2}".format(1, 1, n - 2))
else:
    sys.stdout.write("{0} {1} {2}".format(1, 2, n - 3))


def main():
    n = int(input())
    if (n % 3 == 0) or (n % 3 == 1):
        print(1, 1, n - 2)
    else:
        print(1, 2, n - 3)


def __starting_point():
    main()

__starting_point()

n = int(input())
a = 1
b = 1
c = n - a - b
if c % 3 == 0:
    c -= 1
    b += 1
print(a, b, c)



n = int(input())
if (n - 2) % 3 != 0:
    print(f'1 1 {n-2}')
else:
    print(f'1 2 {n - 3}')


n=int(input())
if (n-2)%3!=0:
    print(1,1,n-2)
else:
    print(1,2,n-3)


n = int(input())
if n%3 == 0:
    print(n-2, 1, 1)
elif n%3 == 1:
    print(n-2, 1, 1)
else:
    print(n-3, 1, 2)

3

import math
import sys


DEBUG = False


def inp():
    return sys.stdin.readline().rstrip()


def dprint(*value, sep=' ', end='\n'):
    if DEBUG:
        print(*value, sep=sep, end=end)


def solve(N):
    if N % 3 < 2:
        return (1, 1, N - 2)
    return (1, 2, N - 3)


def main():
    print(*solve(int(inp())))


def __starting_point():
    main()

__starting_point()

n = int(input())
if (n%3==0) | (n%3==1):
    print(1,1,n-2)
else:
    print(1,2,n-3)



n=int(input())
if n%3==2:
    print(1,2,n-3)
else:
    print(1,1,n-2)

n = int(input())
if n % 3 != 2:
    print(1, 1, n - 2)
else:
    print(1, 2, n - 3)

n = int(input())

if n % 3 == 2:
    print(1, 2, n-3)
else:
    print(1, 1, n-2)