#include <stdio.h>
#define MAX 100005
#define NIL -1

struct Node {
  int p, l, r;
};

struct Node T[MAX];
int n, D[MAX];

void print(int u) {
  printf("node %d: ", u);
  printf("parent = %d, ", T[u].p);
  printf("depth = %d, ", D[u]);

  if (T[u].p == NIL) printf("root, ");
  else if (T[u].l == NIL) printf("leaf, ");
  else printf("internal node, ");

  printf("[");
  for (int i = 0, c = T[i].l; c != NIL; i++, c = T[c].r) {
    if (i) printf(", ");
    printf("%d", c);
  }
  printf("]\n");
}

void rec(int u, int p) {
  D[u] = p;
  if (T[u].r != NIL) rec(T[u].r, p);
  if (T[u].l != NIL) rec(T[u].l, p + 1);
}

int main() {
  int d, v, c, l, r;
  scanf("%d", &n);
  for (int i = 0; i < n; i++) {
    T[i].p = NIL;
    T[i].l = NIL;
    T[i].r = NIL;
  }

  for (int i = 0; i < n; i++) {
    scanf("%d %d", &v, &d);
    for (int j = 0; j < d; j++) {
      scanf("%d", &c);
      if (j == 0) {
        T[v].l = c;
      } else {
        T[l].r = c;
      }
      l = c;
      T[c].p = v;
    }
  }

  for (int i = 0; i < n; i++) {
    if (T[i].p == NIL) r = i;
  }

  rec(r, 0);

  for (int i = 0; i < n; i++) print(i);

  return 0;
}

