#include <stdio.h>
#include <stdlib.h>
#include <string.h>

#define ROOT 0
#define INTERNAL 1
#define LEAF 2

struct node {
  int id;
  int k;
  struct node *parent;
  int depth;
  int type;
  int *child_id;
  struct node **child;
};

struct node *tree;
int n;

struct node *search_node(int id);
void set_parameter(struct node *p);
void quicksort(struct node *A, int p, int r);
int partition(struct node *A, int p, int r);

int main(int argc, char *argv[])
{
  int i, j;
  struct node *tmp;
  
  scanf("%d", &n);

  tree = (struct node *)malloc(sizeof(struct node) * n);

  for (i = 0; i < n; i++) {
    scanf("%d", &(tree[i].id));
    scanf("%d", &(tree[i].k));
    if (tree[i].k != 0) {
      tree[i].child_id = (int *)malloc(sizeof(int) * (tree[i].k));
      tree[i].child = (struct node **)malloc(sizeof(struct node *) * (tree[i].k));
      for (j = 0; j < tree[i].k; j++) {
	scanf("%d", &(tree[i].child_id[j]));
      }
    } else {
      tree[i].child_id = NULL;
      tree[i].child = NULL;
    }
    tree[i].parent = NULL;
  }

  quicksort(tree, 0, n - 1);

  for (i = 0; i < n; i++) {
    for (j = 0; j < tree[i].k; j++) {
      tmp = search_node(tree[i].child_id[j]);
      if (tmp == NULL) {
	fprintf(stderr, "error\n");
	exit(0);
      }
      tmp->parent = &tree[i];
      tree[i].child[j] = tmp;
    }
  }

  for (i = 0; i < n; i++) {
    if (tree[i].parent == NULL) break;
  }
  set_parameter(&tree[i]);

  for (i = 0; i < n; i++) {
    printf("node %d: ", tree[i].id);
    
    if (tree[i].parent == NULL) printf("parent = -1, ");
    else printf("parent = %d, ", tree[i].parent->id);
    
    printf("depth = %d, ", tree[i].depth);
    
    if (tree[i].type == ROOT) printf("root, ");
    else if (tree[i].type == INTERNAL) printf("internal node, ");
    else printf("leaf, ");

    printf("[");
    for (j = 0; j < tree[i].k; j++) {
      if (j != tree[i].k - 1) printf("%d, ", tree[i].child[j]->id);
      else printf("%d", tree[i].child[j]->id);
    }
    printf("]\n");
  }

  return 0;
}

struct node *search_node(int id)
{
  int i;

  for (i = 0; i < n; i++) {
    if (tree[i].id == id) return &tree[i];
  }
  return NULL;
}

void set_parameter(struct node *p)
{
  int i;

  if (p->parent == NULL) {
    p->depth = 0;
    p->type = ROOT;
  } else {
    p->depth = p->parent->depth + 1;
    if (p->k == 0) p->type = LEAF;
    else p->type = INTERNAL;
  }

  for (i = 0; i < p->k; i++) set_parameter(p->child[i]);
}

void quicksort(struct node *A, int p, int r)
{
  int q;
  
  if (p < r) {
    q = partition(A, p, r);
    quicksort(A, p, q-1);
    quicksort(A, q+1, r);
  }
}

int partition(struct node *A, int p, int r)
{
  int x = A[r].id, i = p - 1, j;
  struct node tmp;

  for (j = p; j < r; j++) {
    if (A[j].id <= x) {
      i++;
      memcpy(&tmp, &A[j], sizeof(struct node));
      memcpy(&A[j], &A[i], sizeof(struct node));
      memcpy(&A[i], &tmp, sizeof(struct node));
    }
  }
  memcpy(&tmp, &A[r], sizeof(struct node));
  memcpy(&A[r], &A[i+1], sizeof(struct node));
  memcpy(&A[i+1], &tmp, sizeof(struct node));

  return i+1;
}