#include <stdio.h>
int n;

int parent[100000];
int sibling[100000];
int degree[100000];

int Depth(int i);
int Height(int i);

int main(){
  int i, j, l, r, id;
  scanf("%d",&n);
  for(i = 0;i < n;i++){
    parent[i] = -1;
    sibling[i] = -1;
    degree[i] = 0;
  }

  for(i = 0;i < n;i++){
    scanf("%d%d%d",&id, &l, &r);
    if(l != -1){
      parent[l] = id;
      sibling[l] = id;
      ++degree[id];
    }
    
    
    if(r != -1){
      parent[r] = id;
      sibling[r] = id;
      ++degree[id];
    }
  } 
  
  for(i = 0; i < n; ++i) {
    int depth = Depth(i);
    
    printf("node %d: parent = %d, sibling = %d, degree = %d, depth = %d, height = %d, ", i, parent[i], sibling[i], degree[i], depth, Height(i));
    
    if(depth == 0) {
      printf("root\n");
    } else if(degree[i] == 0) {
      printf("leaf\n");
    } else {
      printf("internal node\n");
    }
  }                                                                         
  return 0;
}

int Depth(int i){
  if(parent[i] == -1) return 0;
  return Depth(parent[i]) + 1;
}

int Height(int i){
  int j, h;
  
  h = 0;
  for(j = 0; j < n; ++j){
    if(parent[j] == i){
      int tmp = Height(j) + 1;
      if(tmp > h){
	h = tmp;
      }
    }
  }
  return h;
}
  