A16363 | $Sum of Three$

时间限制1s

内存限制256MB

通过 / 提交0/0

题目描述

Monocarp has an integer $n$ . He wants to represent his number as a sum of three distinct positive integers $x$ , $y$ , and $z$ . Additionally, Monocarp wants none of the numbers $x$ , $y$ , and $z$ to be divisible by $3$ . Your task is to help Monocarp to find any valid triplet of distinct positive integers $x$ , $y$ , and $z$ , or report that such a triplet does not exist.

The first line contains a single integer $t$ ( $1 \le t \le 10^4$ ) — the number of testcases. The only line of each testcase contains a single integer $n$ ( $1 \le n \le 10^{9}$ ).

For each testcase, if there is no valid triplet $x$ , $y$ , and $z$ , print NO on the first line. Otherwise, print YES on the first line. On the second line, print any valid triplet of distinct positive integers $x$ , $y$ , and $z$ such that $x + y + z = n$ , and none of the printed numbers are divisible by $3$ . If there are multiple valid triplets, you can print any of them.

输入 #1

输出 #1

YES
4 5 1
NO
YES
2 8 5
NO

C++ 编辑器

输入

输出