Codeforces Round 290 (Div. 2)
E
Fox And Dinner
Codeforces
2300
原题
← D→
翻译中…

Fox Ciel is participating in a party in Prime Kingdom. There are $*n*$ foxes there (include Fox Ciel). The i-th fox is $*a*_{*i*}$ years old.

翻译中…

They will have dinner around some round tables. You want to distribute foxes such that:

翻译中…
  1. Each fox is sitting at some table.
  2. Each table has at least 3 foxes sitting around it.
  3. The sum of ages of any two adjacent foxes around each table should be a prime number.
翻译中…

If $*k*$ foxes $*f*_{1}$, $*f*_{2}$, ..., $*f*_{*k*}$ are sitting around table in clockwise order, then for $1 ≤ *i* ≤ *k* - 1$: $*f*_{*i*}$ and $*f*_{*i* + 1}$ are adjacent, and $*f*_{1}$ and $*f*_{*k*}$ are also adjacent.

翻译中…

If it is possible to distribute the foxes in the desired manner, find out a way to do that.

翻译中…

Input

翻译中…

The first line contains single integer $*n*$ ($3 ≤ *n* ≤ 200$): the number of foxes in this party.

翻译中…

The second line contains $*n*$ integers $*a*_{*i*}$ ($2 ≤ *a*_{*i*} ≤ 10^{4}$).

翻译中…

Output

翻译中…

If it is impossible to do this, output "Impossible".

翻译中…

Otherwise, in the first line output an integer $*m*$ (image): the number of tables.

翻译中…

Then output $*m*$ lines, each line should start with an integer $*k*$ -=– the number of foxes around that table, and then $*k*$ numbers — indices of fox sitting around that table in clockwise order.

翻译中…

If there are several possible arrangements, output any of them.

翻译中…

Note

翻译中…

In example 1, they can sit around one table, their ages are: 3-8-9-4, adjacent sums are: 11, 17, 13 and 7, all those integers are primes.

翻译中…

In example 2, it is not possible: the sum of 2+2 = 4 is not a prime number.

翻译中…

样例

Input #1
4
3 4 8 9
Output #1
1
4 1 2 4 3
InputCopy OutputCopy
Input #2
5
2 2 2 2 2
Output #2
Impossible
InputCopy OutputCopy
Input #3
12
2 3 4 5 6 7 8 9 10 11 12 13
Output #3
1
12 1 2 3 6 5 12 9 8 7 10 11 4
InputCopy OutputCopy
Input #4
24
2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25
Output #4
3
6 1 2 3 6 5 4
10 7 8 9 12 15 14 13 16 11 10
8 17 18 23 22 19 20 21 24
InputCopy OutputCopy
题目信息
题号
510E
时间限制
2 s
内存限制
256 MB
标签
网络流

题面与样例版权归 Codeforces 及出题人所有;中文翻译由 AI 生成(CI 管线),如有出入请以原文为准。