Fox Ciel is participating in a party in Prime Kingdom. There are n foxes there (include Fox Ciel). The i-th fox is ai 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 f1, f2, ..., fk are sitting around table in clockwise order, then for 1 ≤ i ≤ k - 1: fi and fi + 1 are adjacent, and f1 and fk 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 ai (2 ≤ ai ≤ 104).

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.

Examples

Input

4
3 4 8 9


Output

1
4 1 2 4 3


Input

5
2 2 2 2 2


Output

Impossible


Input

12
2 3 4 5 6 7 8 9 10 11 12 13


Output

1
12 1 2 3 6 5 12 9 8 7 10 11 4


Input

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

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

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.
#include <bits/stdc++.h>
using namespace std;
const int MAXV = 210;
const int MAXE = 300000;
int n, h, a[MAXV], lv[MAXV], parent[MAXV], t[MAXV];
int graph[MAXV][MAXV], used[MAXV][MAXV];
bool prime[MAXE];
int S = MAXV - 1, T = MAXV - 2;
vector<vector<int> > cycles;
void init() {
  memset(graph, 0, sizeof graph);
  memset(used, 0, sizeof used);
  for (int i = 2; i < MAXE; i++)
    for (int j = i + i; j < MAXE; j += i) prime[j] = true;
}
bool bfs() {
  queue<int> qu;
  qu.push(S);
  t[S] = 1;
  parent[S] = -1;
  while (!qu.empty()) {
    int v = qu.front();
    qu.pop();
    for (int i = 0; i < MAXV; i++) {
      if (!t[i] && graph[v][i] != 0) {
        t[i] = t[v] + 1;
        parent[i] = v;
        qu.push(i);
      }
    }
  }
  return t[T] != 0;
}
void get_path_from(int u) {
  t[u] = 1;
  cycles.back().push_back(u);
  for (int i = 0; i < n; i++)
    if (!t[i]) {
      if (graph[u][i] != used[u][i]) get_path_from(i);
    }
}
void solve() {
  if (2 * h != n) {
    printf("Impossible\n");
    return;
  }
  int i, j;
  for (i = 0; i < n; i++) {
    for (j = 0; j < n; j++) {
      if (i == j) continue;
      if (!prime[a[i] + a[j]]) {
        if (a[i] & 1) {
          graph[i][j] = used[i][j] = 1;
        } else {
          graph[j][i] = used[j][i] = 1;
        }
      }
    }
  }
  int mf = 0, flow, x;
  while (true) {
    memset(t, 0, sizeof(t));
    if (!bfs()) break;
    flow = INT_MAX;
    x = T;
    while (x != S) {
      flow = min(flow, graph[parent[x]][x]);
      x = parent[x];
    }
    x = T;
    while (x != S) {
      graph[parent[x]][x] -= flow;
      graph[x][parent[x]] += flow;
      x = parent[x];
    }
    mf += flow;
  }
  if (mf != 2 * h) {
    printf("Impossible\n");
    return;
  }
  memset(t, 0, sizeof(t));
  for (i = 0; i < n; i++)
    if (!t[i]) {
      cycles.push_back(vector<int>());
      get_path_from(i);
    }
  printf("%d\n", (int)cycles.size());
  for (i = 0; i < (int)cycles.size(); i++) {
    printf("%d ", (int)cycles[i].size());
    for (j = 0; j < (int)cycles[i].size(); j++) {
      if (j) printf(" ");
      printf("%d", 1 + cycles[i][j]);
    }
    printf("\n");
  }
}
int main() {
  init();
  scanf("%d", &n);
  h = 0;
  for (int i = 0; i < n; i++) {
    scanf("%d", &a[i]);
    if (a[i] & 1) {
      graph[S][i] = 2;
      h++;
    } else {
      graph[i][T] = 2;
    }
  }
  solve();
  return 0;
}
