Problem: Yesterday was a fair in a supermarket's grocery section. There were n jars with spices on the fair. Before the event the jars were numbered from 1 to n from the left to the right. After the event the jars were moved and the grocer had to sort them by the increasing of the numbers.

The grocer has a special machine at his disposal. The machine can take any 5 or less jars and rearrange them in the way the grocer wants. Note that the jars do not have to stand consecutively. For example, from the permutation 2, 6, 5, 4, 3, 1 one can get permutation 1, 2, 3, 4, 5, 6, if pick the jars on the positions 1, 2, 3, 5 and 6. 

Which minimum number of such operations is needed to arrange all the jars in the order of their numbers' increasing?

Input

The first line contains an integer n (1 ≤ n ≤ 105). The second line contains n space-separated integers ai (1 ≤ ai ≤ n) — the i-th number represents the number of a jar that occupies the i-th position. It is guaranteed that all the numbers are distinct.

Output

Print on the first line the least number of operations needed to rearrange all the jars in the order of the numbers' increasing. Then print the description of all actions in the following format.

On the first line of the description of one action indicate the number of jars that need to be taken (k), on the second line indicate from which positions the jars need to be taken (b1, b2, ..., bk), on the third line indicate the jar's new order (c1, c2, ..., ck). After the operation is fulfilled the jar from position bi will occupy the position ci. The set (c1, c2, ..., ck) should be the rearrangement of the set (b1, b2, ..., bk).

If there are multiple solutions, output any.

Examples

Input

6
3 5 6 1 2 4


Output

2
4
1 3 6 4 
3 6 4 1 
2
2 5 
5 2 


Input

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


Output

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

Note

Let's consider the first sample. The jars can be sorted within two actions.

During the first action we take the jars from positions 1, 3, 6 and 4 and put them so that the jar that used to occupy the position 1 will occupy the position 3 after the operation is completed. The jar from position 3 will end up in position 6, the jar from position 6 will end up in position 4 and the jar from position 4 will end up in position 1.

After the first action the order will look like that: 1, 5, 3, 4, 2, 6. 

During the second operation the jars in positions 2 and 5 will change places.

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
const int INF = 1e9;
const int MOD = 1e9 + 7;
const long long INF64 = 1e18;
const long double EPS = 1e-7;
mt19937 myrand(time(NULL));
const int N = 100 * 1000 + 13;
int a[N], b[N];
int n;
bool read() {
  if (scanf("%d", &n) != 1) return 0;
  for (int i = 0; i < (n); i++) {
    scanf("%d", &a[i]);
    --a[i];
  }
  return 1;
}
char used[N];
vector<int> c[N];
int k;
void dfs(int v) {
  c[k].push_back(v);
  used[v] = 1;
  if (!used[a[v]]) dfs(a[v]);
}
bool comp(const vector<int> &a, const vector<int> &b) {
  return ((int)(a).size() < (int)(b).size());
}
void solve() {
  memset(used, 0, sizeof(used));
  k = 0;
  for (int i = 0; i < (n); i++) {
    b[i] = i;
    if (!used[i]) {
      dfs(i);
      if ((int)(c[k]).size() > 1)
        k++;
      else
        c[k] = vector<int>();
    }
  }
  sort(c, c + k, comp);
  int l = 0;
  int res = 0;
  vector<pair<int, int> > ans[N];
  for (int i = 0; i < (k); i++) {
    int p = 0;
    while ((int)(c[i]).size() - p > 5) {
      for (int j = 0; j < 3; j++, p++)
        ans[res].push_back(make_pair(b[c[i][p]], b[c[i][p + 1]]));
      ans[res].push_back(
          make_pair(b[c[i][p]], b[c[i][(int)(c[i]).size() - 1]]));
      p++;
      ans[res].push_back(
          make_pair(b[c[i][(int)(c[i]).size() - 1]], b[c[i][p - 4]]));
      swap(b[c[i][(int)(c[i]).size() - 1]], b[c[i][p]]);
      swap(c[i][(int)(c[i]).size() - 1], c[i][p]);
      res++;
    }
    vector<int> tmp;
    for (int j = (p); j < ((int)(c[i]).size()); j++) tmp.push_back(c[i][j]);
    c[i] = tmp;
  }
  sort(c, c + k, comp);
  for (int i = k - 1; l <= i; i--) {
    for (int j = 0; j < ((int)(c[i]).size()); j++)
      ans[res].push_back(
          make_pair(b[c[i][j]], b[c[i][(j + 1) % (int)(c[i]).size()]]));
    while (l < i && (int)(ans[res]).size() + (int)(c[l]).size() <= 5) {
      for (int j = 0; j < ((int)(c[l]).size()); j++)
        ans[res].push_back(
            make_pair(b[c[l][j]], b[c[l][(j + 1) % (int)(c[l]).size()]]));
      l++;
    }
    if (l < i && (int)(ans[res]).size() == 3 && (int)(c[l]).size() == 3) {
      ans[res].push_back(make_pair(b[c[l][0]], b[c[l][1]]));
      ans[res].push_back(make_pair(b[c[l][1]], b[c[l][0]]));
      c[l] = {c[l][0], c[l][2]};
    }
    res++;
  }
  printf("%d\n", res);
  memset(used, 0, sizeof(used));
  for (int i = 0; i < (res); i++) {
    printf("%d\n", (int)(ans[i]).size());
    for (int j = 0; j < ((int)(ans[i]).size()); j++) {
      printf("%d ", ans[i][j].first + 1);
      used[ans[i][j].first] = 1;
    }
    printf("\n");
    for (int j = 0; j < ((int)(ans[i]).size()); j++) {
      printf("%d ", ans[i][j].second + 1);
      used[ans[i][j].second] = 0;
    }
    printf("\n");
    for (int j = 0; j < ((int)(ans[i]).size()); j++)
      assert(used[ans[i][j].first] == 0);
    assert((int)(ans[i]).size() <= 5);
  }
}
int main() {
  while (read()) solve();
  return 0;
}