【题解】codeforces1047A[Codeforces Round #511 (Div. 2)]A.Little C Loves 3 I 数学知识

题目链接

Description

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≤109) — 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

---

可以考虑特殊解的情况。固定一个解为 $1$，如果 $n-2$ 不是 $3$ 的倍数，则答案 $1,1,n-2$，否则答案 $1,2,n-3$。

#include<cstdio>
int n;
int main()
{
    scanf("%d",&n);
    if((n-2)%3)printf("1 1 %d\n",n-2);
    else printf("1 2 %d\n",n-3);
    return 0;
}

总结

从特殊情况下手比较简单。