<?php
// solve1();
solve2();

// 左子右兄弟表現の実装


// 自力解
function solve1(){
	$n = (int)trim(fgets(STDIN));

	$list = [];
	for ($i=0; $i < $n; $i++) { 
		$node = new TreeNode($i);
		$list[$node->getId()] = $node;
	}
	for ($i=0; $i < $n; $i++) { 
		$input = explode(' ', trim(fgets(STDIN)));
		$id = (int)$input[0];
		$k = (int)$input[1];
		for ($j=0; $j < $k; $j++) { 
			$list[$id]->addChild((int)$input[$j+2]);
			$list[(int)$input[$j+2]]->setParentId($id);
		}
	}
	for ($i=0; $i < $n; $i++) { 
		if ($list[$i]->getParentId() === -1) {
			// root
			$curId = $i;
			break;
		}
	}
	// objectは参照渡しされるので、$listを参照渡しにしなくても$list内のobjectは関数内部で変更される！！
	dfs($list, $curId, 0);
	$list[$curId]->setType('root');

	foreach ($list as $v) {
		echo 'node ' . $v->getId() . ': parent = ' . $v->getParentId() . ', depth = ' . $v->getDepth() . ', '  . $v->getType() . ', [' . implode(', ', $v->getChildren()) . ']' . PHP_EOL;
	}
}

function dfs($list, $id, $depth){
	$list[$id]->setDepth($depth);
	++$depth;
	if($list[$id]->hasChild()){
		$list[$id]->setType('internal node');
		$children = $list[$id]->getChildren();
		foreach ($children as $c) {
			dfs($list, $c, $depth);
		}
	}
}

/**
 * 
 */
class TreeNode
{
	private $id;
	private $parent_id = -1;
	private $children = [];
	private $depth = 0;
	private $type = 'leaf';

	function __construct($id)
	{
		$this->id = $id;
	}

	function setParentId($p_id){
		$this->parent_id = $p_id;
	}
	function addChild($c_id){
		$this->children[] = $c_id;
	}
	function hasChild(){
		return count($this->children) > 0;
	}
	function getId(){
		return $this->id;
	}
	function getParentId(){
		return $this->parent_id;
	}
	function getChildren(){
		return $this->children;
	}
	function setDepth($d){
		$this->depth = $d;
	}
	function addDepth(){
		$this->depth += 1;
	}
	function getDepth(){
		return $this->depth;
	}
	function setType($t){
		$this->type = $t;
	}
	function getType(){
		return $this->type;
	}
}


function solve2(){
	$n = (int)trim(fgets(STDIN));

	$list = [];
	for ($i=0; $i < $n; $i++) { 
		$node = new LcRsNode($i);
		$list[$i] = $node;
	}
	for ($i=0; $i < $n; $i++) { 
		$input = explode(' ', trim(fgets(STDIN)));
		$id = (int)$input[0];
		$k = (int)$input[1];
		if ($k > 0) {
			$list[$id]->setLeft((int)$input[2]);
			for ($j=0; $j < $k; $j++) { 
				$list[(int)$input[$j+2]]->setParentId($id);
				if (isset($input[$j+3])) {
					$list[(int)$input[$j+2]]->setRight((int)$input[$j+3]);
				}
			}
		}
	}
	for ($i=0; $i < $n; $i++) { 
		if ($list[$i]->getParentId() === -1) {
			// root
			$root_id = $i;
		}
	}
	dfs2($list, $root_id, 0);
	foreach ($list as $v) {
		// var_dump($v);
		$type = 'leaf';
		if ($v->getParentId() === -1) {
			$type = 'root';
		}elseif ($v->hasLeft()) {
			$type = 'internal node';
		}
		$children = [];
		if ($v->hasLeft()) {
			$child = $v->getLeft();
			$children[] = $child;
			while ($list[$child]->hasRight()) {
				$child = $list[$child]->getRight();
				$children[] = $child;
			}
		}
		echo 'node ' . $v->getId() . ': parent = ' . $v->getParentId() . ', depth = ' . $v->getDepth() . ', '  . $type . ', [' . implode(', ', $children) . ']' . PHP_EOL;
	}
}

function dfs2($list, $id, $depth){
	$list[$id]->setDepth($depth);
	++$depth;
	if($list[$id]->hasLeft()){
		$children = [];
		$child = $list[$id]->getLeft();
		$children[] = $child;
		while ($list[$child]->hasRight()) {
			$child = $list[$child]->getRight();
			$children[] = $child;
		}
		foreach ($children as $c) {
			dfs2($list, $c, $depth);
		}
	}

}

/**
 * 左子右兄弟表現node
 */
class LcRsNode
{
	private $id;
	private $depth = 0;
	private $parent_id = -1;
	// 一番左の子要素
	private $left = -1;
	// 右側に隣接する兄弟要素
	private $right = -1;

	function __construct($id)
	{
		$this->id = $id;
	}
	function setParentId($p_id){
		$this->parent_id = $p_id;
	}
	function setLeft($l_id){
		$this->left = $l_id;
	}
	function setRight($r_id){
		$this->right = $r_id;
	}
	function getId(){
		return $this->id;
	}
	function getParentId(){
		return $this->parent_id;
	}
	function getLeft(){
		return $this->left;
	}
	function getRight(){
		return $this->right;
	}
	function hasLeft(){
		return $this->left !== -1;
	}
	function hasRight(){
		return $this->right !== -1;
	}
	function setDepth($d){
		$this->depth = $d;
	}
	function addDepth(){
		$this->depth += 1;
	}
	function getDepth(){
		return $this->depth;
	}
}


Measured memory_bytes: 68448