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

struct Node {
  int parent, left, right;
};

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

void setDepth(int, int);
int setHeight(int);
int getSibling(int);
void print(int);

int main(){
  int v, l, r, root = 0;
  int i;
  
  scanf("%d",&n);
  if(n < 1 || n > 25)
    exit(1);
  
  for(i = 0; i < n; i++)
    T[i].parent = NIL;
  
  for(i = 0; i < n; i++){
    scanf("%d %d %d",&v,&l,&r);
    T[v].left = l;
    T[v].right = r;
    if(l != NIL)
      T[l].parent = v;
    if(r != NIL)
      T[r].parent = v;
  }

  for(i = 0; i < n; i++){
    if(T[i].parent == NIL)
      root = i;
  }

  setDepth(root,0);
  setHeight(root);

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

  return 0;
}

void setDepth(int u, int d){
  if(u == NIL)
    return;
  D[u] = d;
  setDepth(T[u].left, d+1);
  setDepth(T[u].right, d+1);
}

int setHeight(int u){
  int h1 = 0;
  int h2 = 0;
  if(T[u].left != NIL)
    h1 = setHeight(T[u].left) + 1;
  if(T[u].right != NIL)
    h2 = setHeight(T[u].right) + 1;

  if(h1 > h2)
    H[u] = h1;
  else
    H[u] = h2;
  
  return H[u];
}

int getSibling(int u){
  if(T[u].parent == NIL)
    return NIL;
  if(T[T[u].parent].left != u && T[T[u].parent].left != NIL)
    return T[T[u].parent].left;
  if(T[T[u].parent].right != u && T[T[u].parent].right != NIL)
    return T[T[u].parent].right;
  return NIL;
}

void print(int u){
  int deg = 0;
  printf("node %d: ",u);
  printf("parent = %d, ",T[u].parent);
  printf("sibling = %d, ",getSibling(u));
  
  if(T[u].left != NIL)
    deg++;
  if(T[u].right != NIL)
    deg++;

  printf("degree = %d, ",deg);
  printf("depth = %d, ",D[u]);
  printf("height = %d, ",H[u]);

  if(T[u].parent == NIL)
    printf("root\n");
  else if(T[u].left == NIL && T[u].right == NIL)
    printf("leaf\n");
  else
    printf("internal node\n");
}

