Problem: We are committed to the well being of all participants. Therefore, instead of the problem, we suggest you enjoy a piece of cake.

Uh oh. Somebody cut the cake. We told them to wait for you, but they did it anyway. There is still some left, though, if you hurry back. Of course, before you taste the cake, you thought about how the cake was cut.

It is known that the cake was originally a regular n-sided polygon, each vertex of which had a unique number from 1 to n. The vertices were numbered in random order.

Each piece of the cake is a triangle. The cake was cut into n - 2 pieces as follows: each time one cut was made with a knife (from one vertex to another) such that exactly one triangular piece was separated from the current cake, and the rest continued to be a convex polygon. In other words, each time three consecutive vertices of the polygon were selected and the corresponding triangle was cut off.

A possible process of cutting the cake is presented in the picture below.

<image> Example of 6-sided cake slicing.

You are given a set of n-2 triangular pieces in random order. The vertices of each piece are given in random order — clockwise or counterclockwise. Each piece is defined by three numbers — the numbers of the corresponding n-sided cake vertices.

For example, for the situation in the picture above, you could be given a set of pieces: [3, 6, 5], [5, 2, 4], [5, 4, 6], [6, 3, 1].

You are interested in two questions.

  * What was the enumeration of the n-sided cake vertices? 
  * In what order were the pieces cut? 



Formally, you have to find two permutations p_1, p_2, ..., p_n (1 ≤ p_i ≤ n) and q_1, q_2, ..., q_{n - 2} (1 ≤ q_i ≤ n - 2) such that if the cake vertices are numbered with the numbers p_1, p_2, ..., p_n in order clockwise or counterclockwise, then when cutting pieces of the cake in the order q_1, q_2, ..., q_{n - 2} always cuts off a triangular piece so that the remaining part forms one convex polygon.

For example, in the picture above the answer permutations could be: p=[2, 4, 6, 1, 3, 5] (or any of its cyclic shifts, or its reversal and after that any cyclic shift) and q=[2, 4, 1, 3].

Write a program that, based on the given triangular pieces, finds any suitable permutations p and q.

Input

The first line contains a single integer t (1 ≤ t ≤ 1000) — the number of test cases. Then there are t independent sets of input data.

The first line of each set consists of a single integer n (3 ≤ n ≤ 10^5) — the number of vertices in the cake.

The following n - 2 lines describe the numbers of the pieces vertices: each line consists of three different integers a, b, c (1 ≤ a, b, c ≤ n) — the numbers of the pieces vertices of cake given in random order. The pieces are given in random order.

It is guaranteed that the answer to each of the tests exists. It is also guaranteed that the sum of n for all test cases does not exceed 10^5.

Output

Print 2t lines — answers to given t test cases in the order in which they are written in the input. Each answer should consist of 2 lines.

In the first line of an answer on a test case print n distinct numbers p_1, p_2, ..., p_n(1 ≤ p_i ≤ n) — the numbers of the cake vertices in clockwise or counterclockwise order.

In the second line of an answer on a test case print n - 2 distinct numbers q_1, q_2, ..., q_{n - 2}(1 ≤ q_i ≤ n - 2) — the order of cutting pieces of the cake. The number of a piece of the cake corresponds to its number in the input.

If there are several answers, print any. It is guaranteed that the answer to each of the tests exists.

Example

Input


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


Output


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

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
void *wmem;
char memarr[96000000];
template <class T>
inline void walloc1d(T **arr, int x, void **mem = &wmem) {
  static int skip[16] = {0, 15, 14, 13, 12, 11, 10, 9, 8, 7, 6, 5, 4, 3, 2, 1};
  (*mem) = (void *)(((char *)(*mem)) + skip[((unsigned long long)(*mem)) & 15]);
  (*arr) = (T *)(*mem);
  (*mem) = ((*arr) + x);
}
inline void rd(int &x) {
  int k;
  int m = 0;
  x = 0;
  for (;;) {
    k = getchar();
    if (k == '-') {
      m = 1;
      break;
    }
    if ('0' <= k && k <= '9') {
      x = k - '0';
      break;
    }
  }
  for (;;) {
    k = getchar();
    if (k < '0' || k > '9') {
      break;
    }
    x = x * 10 + k - '0';
  }
  if (m) {
    x = -x;
  }
}
inline int rd_int(void) {
  int x;
  rd(x);
  return x;
}
inline void wt_L(char a) { putchar(a); }
inline void wt_L(int x) {
  int s = 0;
  int m = 0;
  char f[10];
  if (x < 0) {
    m = 1;
    x = -x;
  }
  while (x) {
    f[s++] = x % 10;
    x /= 10;
  }
  if (!s) {
    f[s++] = 0;
  }
  if (m) {
    putchar('-');
  }
  while (s--) {
    putchar(f[s] + '0');
  }
}
struct unionFind {
  int *d;
  int N;
  int M;
  inline void malloc(const int n) {
    d = (int *)std::malloc(n * sizeof(int));
    M = n;
  }
  inline void free(void) { std::free(d); }
  inline void walloc(const int n, void **mem = &wmem) {
    walloc1d(&d, n, mem);
    M = n;
  }
  inline void init(const int n) {
    int i;
    N = n;
    for (i = (0); i < (n); i++) {
      d[i] = -1;
    }
  }
  inline void init(void) { init(M); }
  inline int get(int a) {
    int t = a;
    int k;
    while (d[t] >= 0) {
      t = d[t];
    }
    while (d[a] >= 0) {
      k = d[a];
      d[a] = t;
      a = k;
    }
    return a;
  }
  inline int connect(int a, int b) {
    if (d[a] >= 0) {
      a = get(a);
    }
    if (d[b] >= 0) {
      b = get(b);
    }
    if (a == b) {
      return 0;
    }
    if (d[a] < d[b]) {
      d[a] += d[b];
      d[b] = a;
    } else {
      d[b] += d[a];
      d[a] = b;
    }
    return 1;
  }
  inline int operator()(int a) { return get(a); }
  inline int operator()(int a, int b) { return connect(a, b); }
  inline int &operator[](const int a) { return d[a]; }
  inline int size(int a) {
    a = get(a);
    return -d[a];
  }
  inline int sizeList(int res[]) {
    int i;
    int sz = 0;
    for (i = (0); i < (N); i++) {
      if (d[i] < 0) {
        res[sz++] = -d[i];
      }
    }
    return sz;
  }
};
int N;
int A[100000][3];
unionFind uf;
deque<int> g[100000];
set<int> tri[100000];
int st[100000];
int sts;
int res1[100000];
int res2[100000];
int ress;
void merge(int i, int j) {
  int ii;
  int jj;
  int x;
  int y;
  int z;
  int d;
  int v;
  x = ii = uf(i);
  y = jj = uf(j);
  uf(i, j);
  z = uf(i);
  d = (z ^ x ^ y);
  if (g[z].front() == i || g[z].front() == j) {
    if (g[d].front() == i || g[d].front() == j) {
      while (g[d].size()) {
        g[z].push_front(g[d].front());
        g[d].pop_front();
      }
    } else {
      while (g[d].size()) {
        g[z].push_front(g[d].back());
        g[d].pop_back();
      }
    }
  } else {
    if (g[d].front() == i || g[d].front() == j) {
      while (g[d].size()) {
        g[z].push_back(g[d].front());
        g[d].pop_front();
      }
    } else {
      while (g[d].size()) {
        g[z].push_back(g[d].back());
        g[d].pop_back();
      }
    }
  }
}
int main() {
  int WYIGIcGE;
  wmem = memarr;
  int i;
  int j;
  int k;
  int t;
  int a;
  uf.malloc(100000);
  int t_ynMSdg = rd_int();
  for (WYIGIcGE = (0); WYIGIcGE < (t_ynMSdg); WYIGIcGE++) {
    rd(N);
    for (i = (0); i < (N - 2); i++) {
      {
        int hCmBdyQB;
        for (hCmBdyQB = (0); hCmBdyQB < (3); hCmBdyQB++) {
          rd(A[i][hCmBdyQB]);
          A[i][hCmBdyQB] += (-1);
        }
      }
    }
    uf.init(N);
    for (i = (0); i < (N); i++) {
      g[i].clear();
      g[i].push_back(i);
    }
    sts = 0;
    for (i = (0); i < (N); i++) {
      tri[i].clear();
    }
    for (i = (0); i < (N - 2); i++) {
      for (j = (0); j < (3); j++) {
        tri[A[i][j]].insert(i);
      }
    }
    for (i = (0); i < (N); i++) {
      if (tri[i].size() == 1) {
        st[sts++] = i;
      }
    }
    ress = 0;
    while (sts) {
      i = st[--sts];
      if (tri[i].size() == 0) {
        continue;
      }
      t = *(tri[i].begin());
      res2[ress++] = t;
      j = k = -1;
      for (a = (0); a < (3); a++) {
        if (A[t][a] == i) {
          continue;
        }
        if (j == -1) {
          j = A[t][a];
          continue;
        }
        k = A[t][a];
      }
      tri[i].erase(t);
      tri[j].erase(t);
      if (tri[j].size() == 1) {
        st[sts++] = j;
      }
      tri[k].erase(t);
      if (tri[k].size() == 1) {
        st[sts++] = k;
      }
      if (uf(i) != uf(j)) {
        merge(i, j);
      }
      if (uf(i) != uf(k)) {
        merge(i, k);
      }
    }
    i = uf(0);
    k = 0;
    for (int x : g[i]) {
      res1[k++] = x;
    }
    {
      int X9Iss0pP;
      if (N == 0) {
        putchar('\n');
      } else {
        for (X9Iss0pP = (0); X9Iss0pP < (N - 1); X9Iss0pP++) {
          wt_L(res1[X9Iss0pP] + 1);
          wt_L(' ');
        }
        wt_L(res1[X9Iss0pP] + 1);
        wt_L('\n');
      }
    }
    {
      int O3U4gd88;
      if (ress == 0) {
        putchar('\n');
      } else {
        for (O3U4gd88 = (0); O3U4gd88 < (ress - 1); O3U4gd88++) {
          wt_L(res2[O3U4gd88] + 1);
          wt_L(' ');
        }
        wt_L(res2[O3U4gd88] + 1);
        wt_L('\n');
      }
    }
  }
  return 0;
}