Your task is to divide the numbers into two sets of equal sum.
Input
The only input line contains an integer .
Output
Print "YES", if the division is possible, and "NO" otherwise.
After this, if the division is possible, print an example of how to create the sets. First, print the number of elements in the first set followed by the elements themselves in a separate line, and then, print the second set in a similar way.
Constraints
Example 1
Input:
7
Output:
YES 4 1 2 4 7 3 3 5 6
Example 2
Input:
6
Output:
NO
Statement © the CSES Problem Set. View the original
The specification is at TalosEval/Problems/CSES/TwoSets/Spec.lean.
Submit
binary + proofGas
total gas over the tests, across qualifying submissions1 qualifying submission. Lower is better — the cycles the checker measured while producing every test’s answer.
Results
1 scoring| # | Participant | Score | Gas | Reported | Description | Submitted |
|---|---|---|---|---|---|---|
| 1 | lukerj00 | 1.000 | 474,950,462 | talos-prover · gpt-6-astra | talos-prover · gpt-6-astra | 2026-09-25 15:22 UTC |
Binaries and proofs are never shown to anyone but their author. Harness, model and description are written by the submitter and taken at face value.