Problem: 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.

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
const int mod = 1e9 + 7;
const int inf = 1e9;
long long powm(long long a, long long p, long long m) {
  long long r = 1 % m;
  while (p) {
    if (p & 1) r = r * a % m;
    p >>= 1;
    a = a * a % m;
  }
  return r;
}
bool issimple(int d) {
  for (int i = 2; i * i <= d; ++i)
    if (d % i == 0) return false;
  return true;
}
int g[210][210], n, f[210], s = 0, t, mf[210][210], uses[210];
vector<int> path;
bool bfs() {
  deque<int> q;
  q.push_back(s);
  vector<int> d(n + 2, -1);
  d[s] = 0;
  while (!q.empty()) {
    int v = q.front();
    q.pop_front();
    for (int i = 0; i < (n + 2); ++i)
      if (g[v][i] > mf[v][i] && d[i] == -1) {
        d[i] = v;
        q.push_back(i);
      }
  }
  if (d[t] != -1) {
    path.clear();
    int cur = t;
    while (cur != s) {
      path.push_back(cur);
      cur = d[cur];
    }
    path.push_back(s);
    reverse((path).begin(), (path).end());
  }
  return d[t] != -1;
}
int main() {
  scanf("%d", &n);
  t = n + 1;
  int odd = 0;
  for (int i = 0; i < (n); ++i) {
    scanf("%d", f + i + 1);
    if (f[i + 1] % 2 == 1)
      g[s][i + 1] = 2, odd++;
    else
      g[i + 1][t] = 2;
  }
  if (2 * odd != n) {
    puts("Impossible");
    return 0;
  }
  for (int i = 0; i < (n); ++i)
    for (int j = 0; j < (n); ++j)
      if (f[i + 1] % 2) g[i + 1][j + 1] = issimple(f[i + 1] + f[j + 1]);
  for (int i = 0; i < (n); ++i) {
    if (bfs()) {
      for (int j = 0; j < (((int)(path).size()) - 1); ++j) {
        int u = path[j], v = path[j + 1];
        mf[u][v]++;
        mf[v][u]--;
      }
    } else {
      puts("Impossible");
      return 0;
    }
  }
  memset(uses, 0, sizeof(uses));
  vector<vector<int> > ans;
  for (int i = 0; i < (n); ++i)
    if (!uses[i + 1]) {
      vector<int> tmp;
      int c;
      for (c = i + 1; !uses[c];) {
        tmp.push_back(c);
        uses[c] = 1;
        for (int j = 0; j < (n); ++j)
          if (abs(mf[c][j + 1]) == 1 && !uses[j + 1]) {
            c = j + 1;
            break;
          }
      }
      ans.push_back(tmp);
    }
  printf("%d\n", ((int)(ans).size()));
  for (int i = 0; i < (((int)(ans).size())); ++i) {
    printf("%d", ((int)(ans[i]).size()));
    for (int j = 0; j < (((int)(ans[i]).size())); ++j) printf(" %d", ans[i][j]);
    puts("");
  }
  return 0;
}