#define _CRT_SECURE_NO_WARNINGS
#include "bits/stdc++.h"
//#include "libs.h"
#include <random>
#include <unordered_map>
#include <unordered_set>
//#include <opencv2/core.hpp>
//#include <opencv2/highgui.hpp>
//#include <opencv2/imgproc.hpp>

using namespace std;

//呪文
#define DUMPOUT cerr
#define dump(...) DUMPOUT<<"  ";DUMPOUT<<#__VA_ARGS__<<" :["<<__LINE__<<":"<<__FUNCTION__<<"]"<<endl;DUMPOUT<<"    ";dump_func(__VA_ARGS__)

typedef unsigned uint; typedef long long ll; typedef unsigned long long ull; typedef pair<int, int> pii; typedef pair<ll, ll> pll; typedef pair<double, double> pdd; typedef pair<string, string> pss;
template <typename _KTy, typename _Ty> ostream& operator << (ostream& o, const pair<_KTy, _Ty>& m) { o << "{" << m.first << ", " << m.second << "}"; return o; }
template <typename _KTy, typename _Ty> ostream& operator << (ostream& o, const map<_KTy, _Ty>& m) { if (m.empty()) { o << "{ }"; return o; } o << "{" << *m.begin(); for (auto itr = ++m.begin(); itr != m.end(); itr++) { o << ", " << *itr; } o << "}"; return o; }
template <typename _KTy, typename _Ty> ostream& operator << (ostream& o, const unordered_map<_KTy, _Ty>& m) { if (m.empty()) { o << "{ }"; return o; } o << "{" << *m.begin(); for (auto itr = ++m.begin(); itr != m.end(); itr++) { o << ", " << *itr; } o << "}"; return o; }
template <typename _Ty> ostream& operator << (ostream& o, const vector<_Ty>& v) { if (v.empty()) { o << "{ }"; return o; } o << "{" << v.front(); for (auto itr = ++v.begin(); itr != v.end(); itr++) { o << ", " << *itr; } o << "}"; return o; }
template <typename _Ty> ostream& operator << (ostream& o, const set<_Ty>& s) { if (s.empty()) { o << "{ }"; return o; } o << "{" << *(s.begin()); for (auto itr = ++s.begin(); itr != s.end(); itr++) { o << ", " << *itr; } o << "}"; return o; }
template <typename _Ty> ostream& operator << (ostream& o, const unordered_set<_Ty>& s) { if (s.empty()) { o << "{ }"; return o; } o << "{" << *(s.begin()); for (auto itr = ++s.begin(); itr != s.end(); itr++) { o << ", " << *itr; }	o << "}"; return o; }
template <typename _Ty> ostream& operator << (ostream& o, const stack<_Ty>& s) { if (s.empty()) { o << "{ }"; return o; } stack<_Ty> t(s); o << "{" << t.top(); t.pop(); while (!t.empty()) { o << ", " << t.top(); t.pop(); } o << "}";	return o; }
template <typename _Ty> ostream& operator << (ostream& o, const list<_Ty>& l) { if (l.empty()) { o << "{ }"; return o; } o << "{" << l.front(); for (auto itr = ++l.begin(); itr != l.end(); ++itr) { o << ", " << *itr; } o << "}"; return o; }
template <typename _KTy, typename _Ty> istream& operator >> (istream& is, pair<_KTy, _Ty>& m) { is >> m.first >> m.second; return is; }
template <typename _Ty> istream& operator >> (istream& is, vector<_Ty>& v) { for (size_t i = 0; i < v.size(); i++) is >> v[i]; return is; }
namespace aux { // print tuple
	template<typename Ty, unsigned N, unsigned L> struct tp { static void print(ostream& os, const Ty& v) { os << get<N>(v) << ", "; tp<Ty, N + 1, L>::print(os, v); } };
	template<typename Ty, unsigned N> struct tp<Ty, N, N> { static void print(ostream& os, const Ty& v) { os << get<N>(v); } };
}
template<typename... Tys> ostream& operator<<(ostream& os, const tuple<Tys...>& t) { os << "{"; aux::tp<tuple<Tys...>, 0, sizeof...(Tys)-1>::print(os, t); os << "}"; return os; }

template<typename A, size_t N, typename T> inline void Fill(A(&array)[N], const T &val) { std::fill((T*)array, (T*)(array + N), val); }

void dump_func() { DUMPOUT << endl; }
template <class Head, class... Tail> void dump_func(Head&& head, Tail&&... tail) { DUMPOUT << head; if (sizeof...(Tail) == 0) { DUMPOUT << " "; } else { DUMPOUT << ", "; } dump_func(std::move(tail)...); }

#define PI 3.14159265358979323846
#define EPS 1e-10
#define FOR(is,a,n) for(int is=(a);is<(n);++is)
#define REP(is,n)  FOR(is,0,n)
#define all(j) (j).begin(), (j).end()
#define SZ(j) ((int)(j).size())
#define fake false



struct Node {
	int parent;
	int leftmost_child;
	int right_sibling;
	int depth;
	Node() {}
	Node(int p, int c, int s) : parent(p), leftmost_child(c), right_sibling(s) {}
};
ostream& operator<<(ostream& os, const Node& node) {
	cout << "{ parent = " << node.parent << ", leftmost_child = " << node.leftmost_child << ", right_sibling = " << node.right_sibling << ", depth = " << node.depth << " }";
	return os;
}

const int NIL = -1;
vector<Node> nodes;

void setDepth(int v, int p) {
	if (p == NIL)
		nodes[v].depth = 0;
	else
		nodes[v].depth = nodes[p].depth + 1;

	for (int w = nodes[v].leftmost_child; w != NIL; w = nodes[w].right_sibling)
		setDepth(w, v);
}

int main() {

	cin.tie(0);
	ios::sync_with_stdio(false);

	int n;
	cin >> n;

	nodes.resize(n, Node(NIL, NIL, NIL));

	for (int i = 0; i < n; i++) {
		int id, deg;
		cin >> id >> deg;
		vector<int> children(deg);
		cin >> children;
		int v;
		for (int i = 0; i < children.size(); i++) {
			nodes[children[i]].parent = id;
			if (i == 0) 
				nodes[id].leftmost_child = children[i];
			else
				nodes[children[i - 1]].right_sibling = children[i];
		}
	}

	int root;
	for (int i = 0; i < n; i++)
		if (nodes[i].parent == NIL)
			root = i;

	setDepth(root, NIL);

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

		string attr;
		if (nodes[i].parent == NIL)
			attr = "root";
		else if (nodes[i].leftmost_child == NIL)
			attr = "leaf";
		else
			attr = "internal node";

		cout << "node " << i << ": parent = " << nodes[i].parent << ", depth = " << nodes[i].depth << ", " << attr << ", ";
		if (nodes[i].leftmost_child == NIL)
			cout << "[]";
		else {
			cout << "[";
			int v = nodes[i].leftmost_child;
			cout << v;
			for (v = nodes[v].right_sibling; v != NIL; v = nodes[v].right_sibling)
				cout << ", " << v;
			cout << "]";
		}
		cout << endl;
	}

	return 0;
}



Measured memory_bytes: 4456