#P819E. Mister B and Flight to the Moon
Mister B and Flight to the Moon
No submission language available for this problem.
Description
In order to fly to the Moon Mister B just needs to solve the following problem.
There is a complete indirected graph with n vertices. You need to cover it with several simple cycles of length 3 and 4 so that each edge is in exactly 2 cycles.
We are sure that Mister B will solve the problem soon and will fly to the Moon. Will you?
The only line contains single integer n (3 ≤ n ≤ 300).
If there is no answer, print -1.
Otherwise, in the first line print k (1 ≤ k ≤ n2) — the number of cycles in your solution.
In each of the next k lines print description of one cycle in the following format: first print integer m (3 ≤ m ≤ 4) — the length of the cycle, then print m integers v1, v2, ..., vm (1 ≤ vi ≤ n) — the vertices in the cycle in the traverse order. Each edge should be in exactly two cycles.
Input
The only line contains single integer n (3 ≤ n ≤ 300).
Output
If there is no answer, print -1.
Otherwise, in the first line print k (1 ≤ k ≤ n2) — the number of cycles in your solution.
In each of the next k lines print description of one cycle in the following format: first print integer m (3 ≤ m ≤ 4) — the length of the cycle, then print m integers v1, v2, ..., vm (1 ≤ vi ≤ n) — the vertices in the cycle in the traverse order. Each edge should be in exactly two cycles.
Samples
3
2
3 1 2 3
3 1 2 3
5
6
3 5 4 2
3 3 1 5
4 4 5 2 3
4 4 3 2 1
3 4 2 1
3 3 1 5