시간 제한메모리 제한제출정답맞은 사람정답 비율
2 초 512 MB184425.000%

문제

There are $N$ metal bars. The weight of $i$-th metal bar is $2i - 1$.

Your task is to distribute those metal bars into two or more groups such that the sum of weights of metal bars in each group will be the same, or determine that it is impossible. Note that each metal bar must go to exactly one group, and that it is not allowed to cut the metal bars.

입력

The input contains one integer $N$ ($2 \le N \le 10^5$).

출력

If there is no way to distribute the metal bars into two or more equally weighted groups, print one line containing the integer $-1$.

Otherwise, on the first line, print the number of groups $G$ ($2 \le G \le N$). Then print $G$ lines, one for each group. The $i$-th of these lines must start with the the integer $K_i$, the number of metal bars in the $i$-th group. Then print $K_i$ integers: the weights of the metal bars in the group. Each metal bar must be assigned to exactly one group, and the sums of weights of the metal bars in all groups must be the same.

If there is more than one solution, print any one of them.

예제 입력 1

4

예제 출력 1

2
2 1 7
2 3 5

예제 입력 2

2

예제 출력 2

-1

예제 입력 3

3

예제 출력 3

-1