Problem: This is an interactive problem.

The judge has a hidden rooted full binary tree with n leaves. A full binary tree is one where every node has either 0 or 2 children. The nodes with 0 children are called the leaves of the tree. Since this is a full binary tree, there are exactly 2n - 1 nodes in the tree. The leaves of the judge's tree has labels from 1 to n. You would like to reconstruct a tree that is isomorphic to the judge's tree. To do this, you can ask some questions.

A question consists of printing the label of three distinct leaves a1, a2, a3. Let the depth of a node be the shortest distance from the node to the root of the tree. Let LCA(a, b) denote the node with maximum depth that is a common ancestor of the nodes a and b.

Consider X = LCA(a1, a2), Y = LCA(a2, a3), Z = LCA(a3, a1). The judge will tell you which one of X, Y, Z has the maximum depth. Note, this pair is uniquely determined since the tree is a binary tree; there can't be any ties. 

More specifically, if X (or Y, Z respectively) maximizes the depth, the judge will respond with the string "X" (or "Y", "Z" respectively). 

You may only ask at most 10·n questions.

Input

The first line of input will contain a single integer n (3 ≤ n ≤ 1 000) — the number of leaves in the tree.

Output

To print the final answer, print out the string "-1" on its own line. Then, the next line should contain 2n - 1 integers. The i-th integer should be the parent of the i-th node, or -1, if it is the root.

Your answer will be judged correct if your output is isomorphic to the judge's tree. In particular, the labels of the leaves do not need to be labeled from 1 to n. Here, isomorphic means that there exists a permutation π such that node i is the parent of node j in the judge tree if and only node π(i) is the parent of node π(j) in your tree.

Interaction

To ask a question, print out three distinct integers a1, a2, a3. These integers should be between 1 and n, inclusive.

The judge will respond with a single character, either "X", "Y", "Z". 

If the string is "X" (or "Y", "Z" respectively), that means the pair (a1, a2) (or (a2, a3), (a3, a1) respectively) has the deepest LCA among the three pairs.

You may only ask a question at most 10·n times, otherwise, you will get Wrong Answer.

When you are ready to answer, print out a single integer "-1" on its own line. The next line should contain 2n - 1 integers. The i-th integer should be the parent of the i-th node, or -1, if it is the root. Do not forget to flush the final answer as well. Printing the answer does not count as asking a question.

You will get Wrong Answer verdict if 

  * Your question or answers are not in the format described in this statement. 
  * You ask strictly more than 10·n questions. 
  * Your question contains duplicate indices. 
  * Your final answer is not isomorphic to the judge tree. 



You will get Idleness Limit Exceeded if you don't print anything or if you forget to flush the output, including for the final answer (more info about flushing output below).

To flush you can use (just after printing an integer and end-of-line): 

  * fflush(stdout) in C++; 
  * System.out.flush() in Java; 
  * stdout.flush() in Python; 
  * flush(output) in Pascal; 
  * See the documentation for other languages. 



If at any moment your program reads -1 as an answer, it should immediately exit normally (for example, by calling exit(0)). You will get Wrong Answer in this case, it means that you made more queries than allowed, or made an invalid query. If you ignore this, you can get other verdicts since your program will continue to read from a closed stream.

Hacking To hack someone, use the following format 
    
    
      
    n  
    p_1 p_2 ... p_{2n-1}  
    

This denotes a tree where the parent of the i-th node is pi (pi = - 1 or n < pi ≤ 2n - 1). If pi is equal to -1, then node i is the root. This input must describe a valid full rooted binary tree.

Of course, contestant programs will not be able to see this input.

Example

Input

5
X
Z
Y
Y
X<span class="tex-font-style-tt"></span>


Output

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

Note

For the first sample, the judge has the hidden tree:

<image>

Here is a more readable format of the interaction: 

<image> The last line can also be 8 6 9 8 9 7 -1 6 7. 

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
long long gcd(long long a, long long b) { return b == 0 ? a : gcd(b, a % b); }
const int MAXVAL = 1000;
const int MAXN = 2 * MAXVAL - 1;
const int MAXM = MAXN - 1;
int nval;
typedef struct Loc {
  int root;
  int par[MAXN], d[MAXN];
  int chead[MAXN], cnxt[MAXN];
  int leafs[MAXN], ints[MAXN], nleafs, nints;
  void gen() {
    do {
      nleafs = 0;
      for (int i = (0); i < (nval); ++i) leafs[nleafs++] = i;
      nints = 0;
      for (int i = (0); i < (nval - 1); ++i) ints[nints++] = nval + i;
      while (nleafs >= 2) {
        int a, b;
        do {
          a = rand() % nleafs, b = rand() % nleafs;
        } while (a == b);
        if (a > b) swap(a, b);
        int c = rand() % nints;
        par[leafs[a]] = ints[c], par[leafs[b]] = ints[c];
        leafs[a] = ints[c];
        swap(leafs[nleafs - 1], leafs[b]);
        --nleafs;
        swap(ints[nints - 1], ints[c]);
        --nints;
      }
      par[leafs[0]] = -1;
    } while (leafs[0] < nval);
    for (int i = (0); i < (2 * nval - 1); ++i) chead[i] = -1, cnxt[i] = -1;
    for (int i = (0); i < (2 * nval - 1); ++i)
      if (par[i] == -1)
        root = i;
      else
        cnxt[i] = chead[par[i]], chead[par[i]] = i;
    dfs(root);
  }
  void genchain() {
    do {
      nleafs = 0;
      for (int i = (0); i < (nval); ++i) leafs[nleafs++] = i;
      nints = 0;
      for (int i = (0); i < (nval - 1); ++i) ints[nints++] = nval + i;
      while (nleafs >= 2) {
        int a = 0, b = rand() % (nleafs - 1) + 1;
        int c = rand() % nints;
        par[leafs[a]] = ints[c], par[leafs[b]] = ints[c];
        leafs[a] = ints[c];
        swap(leafs[nleafs - 1], leafs[b]);
        --nleafs;
        swap(ints[nints - 1], ints[c]);
        --nints;
      }
      par[leafs[0]] = -1;
    } while (leafs[0] < nval);
    for (int i = (0); i < (2 * nval - 1); ++i) chead[i] = -1, cnxt[i] = -1;
    for (int i = (0); i < (2 * nval - 1); ++i)
      if (par[i] == -1)
        root = i;
      else
        cnxt[i] = chead[par[i]], chead[par[i]] = i;
    dfs(root);
  }
  void dfs(int at) {
    d[at] = par[at] == -1 ? 0 : d[par[at]] + 1;
    for (int to = chead[at]; to != -1; to = cnxt[to]) dfs(to);
  }
  int lca(int a, int b) {
    if (d[a] < d[b]) swap(a, b);
    while (d[a] > d[b]) a = par[a];
    while (a != b) a = par[a], b = par[b];
    return a;
  }
  char query(int a, int b, int c) {
    int x = d[lca(a, b)], y = d[lca(b, c)], z = d[lca(c, a)];
    if (x > y && x > z) return 'X';
    if (y > x && y > z) return 'Y';
    if (z > x && z > y) return 'Z';
    printf("err (%d,%d,%d)->(%d,%d,%d)\n", a, b, c, x, y, z);
    exit(0);
  }
  void print() {
    printf("%d\n", nval);
    for (int i = (0); i < (2 * nval - 1); ++i) {
      if (i != 0) printf(" ");
      printf("%d", par[i] == -1 ? -1 : par[i] + 1);
    }
    puts("");
  }
} Loc;
Loc loc;
bool local = false;
int nq;
char query(int a, int b, int c) {
  ++nq;
  if (local) {
    return loc.query(a, b, c);
  } else {
    printf("%d %d %d\n", a + 1, b + 1, c + 1);
    fflush(stdout);
    char ret;
    scanf(" %c", &ret);
    return ret;
  }
}
int n, m;
int ghead[MAXN], gnxt[2 * MAXM], gto[2 * MAXM], gpar[MAXN], id[MAXN];
bool dead[MAXN];
int addnode(int cid) {
  int ret = n++;
  ghead[ret] = -1, gpar[ret] = -1, id[ret] = cid;
  return ret;
}
void createedge(int a, int b) {
  gnxt[m] = ghead[a], ghead[a] = m, gto[m] = b, ++m;
  gnxt[m] = ghead[b], ghead[b] = m, gto[m] = a, ++m;
}
void setpar(int a, int b) {
  if (gpar[a] == -1) {
    gpar[a] = b;
    if (b != -1) createedge(a, b);
    return;
  }
  int c = gpar[a];
  int m1 = -1;
  while (ghead[c] != -1 && gto[ghead[c]] == a) {
    assert(m1 == -1);
    m1 = ghead[c];
    ghead[c] = gnxt[ghead[c]];
  }
  for (int x = ghead[c]; x != -1; x = gnxt[x])
    while (gnxt[x] != -1 && gto[gnxt[x]] == a) {
      assert(m1 == -1);
      m1 = gnxt[x];
      gnxt[x] = gnxt[gnxt[x]];
    }
  assert(m1 != -1);
  int m2 = -1;
  while (ghead[a] != -1 && gto[ghead[a]] == c) {
    assert(m2 == -1);
    m2 = ghead[a];
    ghead[a] = gnxt[ghead[a]];
  }
  for (int x = ghead[a]; x != -1; x = gnxt[x])
    while (gnxt[x] != -1 && gto[gnxt[x]] == c) {
      assert(m2 == -1);
      m2 = gnxt[x];
      gnxt[x] = gnxt[gnxt[x]];
    }
  assert(m2 != -1);
  gnxt[m1] = ghead[a], ghead[a] = m1, gto[m1] = b;
  gnxt[m2] = ghead[b], ghead[b] = m2, gto[m2] = a;
  gpar[a] = b;
}
int findid(int at) {
  if (id[at] != -1) return id[at];
  for (int x = ghead[at]; x != -1; x = gnxt[x]) {
    int to = gto[x];
    if (to == gpar[at]) continue;
    int ret = findid(to);
    if (ret != -1) return ret;
  }
  return -1;
}
int sz[MAXN];
void dfs1(int at, int par) {
  sz[at] = 1;
  for (int x = ghead[at]; x != -1; x = gnxt[x]) {
    int to = gto[x];
    if (to == par || dead[to]) continue;
    dfs1(to, at);
    sz[at] += sz[to];
  }
}
int dfs2(int at, int par, int totsz) {
  for (int x = ghead[at]; x != -1; x = gnxt[x]) {
    int to = gto[x];
    if (to == par || dead[to]) continue;
    if (2 * sz[to] > totsz) return dfs2(to, at, totsz);
  }
  assert(2 * (totsz - sz[at]) <= totsz);
  return at;
}
int centroid(int at) {
  dfs1(at, -1);
  return dfs2(at, -1, sz[at]);
}
void place(int cur, int at) {
  if (id[at] != -1 || dead[at]) {
    int a = addnode(cur);
    int c = addnode(-1);
    setpar(a, c);
    setpar(c, gpar[at]);
    setpar(at, c);
  } else {
    int root = centroid(at);
    int a = -1, b = -1;
    for (int x = ghead[root]; x != -1; x = gnxt[x]) {
      int to = gto[x];
      if (to == gpar[root]) continue;
      if (a == -1)
        a = to;
      else if (b == -1)
        b = to;
      else
        assert(false);
    }
    assert(a != -1 && b != -1);
    int aid = findid(a), bid = findid(b);
    assert(aid != -1 && bid != -1);
    char res = query(aid, bid, cur);
    dead[root] = true;
    if (res == 'Z') place(cur, a);
    if (res == 'Y') place(cur, b);
    if (res == 'X')
      place(cur, gpar[root] == -1 || dead[gpar[root]] ? root : gpar[root]);
  }
}
void printrec(int at, int d) {
  for (int i = (0); i < (d); ++i) printf(" ");
  if (id[at] != -1)
    printf("%d", id[at] + 1);
  else
    printf("X");
  printf(" [%d]\n", at);
  for (int x = ghead[at]; x != -1; x = gnxt[x]) {
    int to = gto[x];
    if (to == gpar[at]) continue;
    printrec(to, d + 1);
  }
}
void printtree(int at) {
  while (gpar[at] != -1) at = gpar[at];
  printrec(at, 0);
  puts("");
}
void solve() {
  n = 0, m = 0;
  int a = addnode(0);
  int b = addnode(1);
  int c = addnode(-1);
  setpar(a, c);
  setpar(b, c);
  for (int x = (2); x < (nval); ++x) {
    memset(dead, false, sizeof(dead));
    place(x, c);
  }
}
void output() {
  printf("-1\n");
  for (int i = (0); i < (n); ++i) {
    if (i != 0) printf(" ");
    printf("%d", gpar[i] == -1 ? -1 : gpar[i] + 1);
  }
  puts("");
}
void run() {
  scanf("%d", &nval);
  solve();
  output();
}
void stress() {
  for (int x = (0); x < (100); ++x) {
    nval = MAXVAL;
    local = true;
    nq = 0;
    loc.genchain();
    solve();
    printf("nq=%d\n", nq);
  }
}
int main() {
  run();
  return 0;
}