Account
GitHubFeedback
Drafts and results saved on this device
Submit on CSES.fi
CSES Problemset/Introductory Problems

Two Sets

#1092
Ask AI

Open a hint-first prompt in a new AI chat. Grok may ask you to confirm before sending.

Open Claude Desktop

Time limit:1.00 s
Memory limit:512 MB
Unsolved
Download Tests (.zip)

Your task is to divide the numbers 1,2,…,n1,2,\ldots,n into two sets of equal sum.

Input

The only input line contains an integer nn.

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
  • 1≤n≤1061 \le n \le 10^6
Sample Test Cases (2)
Example 1ID: sample-1
Input
7
Expected Output
YES
4
1 2 4 7
3
3 5 6
Example 2ID: sample-2
Input
6
Expected Output
NO
Tools
1
2
3
4
5
6
7
8
9
10
11
12
Draft saved locally
|1 line, 0 chars
Test Bench
Download .zip
Input (stdin)
7
Expected Output
YES
4
1 2 4 7
3
3 5 6