CF1038B Non-Coprime Partition
题目描述
### 题目大意:
给定一个整数$n$,要求把$1$到$n$分别放入两个序列$s1,s2$,使得$\gcd(sum(s1),sum(s2))>1$
输入格式
无
输出格式
无
说明/提示
In the first example, there is no way to partition a single number into two non-empty sets, hence the answer is "No".
In the second example, the sums of the sets are $ 2 $ and $ 4 $ respectively. The $ \mathrm{gcd}(2, 4) = 2 > 1 $ , hence that is one of the possible answers.