#define _USE_MATH_DEFINES
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <clocale>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

using namespace std;

#define IOS ios::sync_with_stdio(false); cin.tie(0);
#define FOR(i, s, n) for(int i = (s), i##_len=(n); i < i##_len; ++i)
#define FORS(i, s, n) for(int i = (s), i##_len=(n); i <= i##_len; ++i)
#define VFOR(i, s, n) for(int i = (s); i < (n); ++i)
#define VFORS(i, s, n) for(int i = (s); i <= (n); ++i)
#define REP(i, n) FOR(i, 0, n)
#define REPS(i, n) FORS(i, 0, n)
#define VREP(i, n) VFOR(i, 0, n)
#define VREPS(i, n) VFORS(i, 0, n)
#define RFOR(i, s, n) for(int i = (s), i##_len=(n); i >= i##_len; --i)
#define RFORS(i, s, n) for(int i = (s), i##_len=(n); i > i##_len; --i)
#define RREP(i, n) RFOR(i, n, 0)
#define RREPS(i, n) RFORS(i, n, 0)
#define ALL(v) (v).begin(), (v).end()
#define SORT(v) sort(ALL(v))
#define RSORT(v) sort(ALL(v), greater<decltype(v[0])>())
#define SZ(x) ((int)(x).size())
#define PB push_back
#define MP make_pair
#define MT make_tuple
#define BIT(n) (1LL<<(n))
#define UNIQUE(v) v.erase(unique(ALL(v)), v.end())

using ll = long long;
using Pi_i = pair<int, int>;
using VB = vector<bool>;
using VC = vector<char>;
using VD = vector<double>;
using VI = vector<int>;
using VLL = vector<ll>;
using VS = vector<string>;
using VSH = vector<short>;

const int MOD = 1000000007;
const int INF = 1000000000;
const int NIL = -1;

template<class T>
bool chmax(T &a, const T &b){
    if(a < b){
        a = b; return true;
    }
    return false;
}
template<class T>
bool chmin(T &a, const T &b){
    if(b < a){
        a = b; return true;
    }
    return false;
}




class RootedTree{
    struct Node{//par :親, lt:左の子, rt:右の兄弟
        int par, lt, rt, d;
        Node(): par(NIL), lt(NIL), rt(NIL), d(0){};
        Node(int P, int L, int R): par(P), lt(L), rt(R), d(0){};
    };
    vector<Node> T;
public:
    RootedTree(int n){
        T.resize(n, Node(NIL, NIL, NIL));
    }

    void setParent(int v, int p){
        T[v].par = p;
    }

    int getParent(int v){
        return T[v].par;
    }

    void setLeft(int v, int l){
        T[v].lt = l;
    }

    int getLeft(int v){
        return T[v].lt;
    }

    void setRight(int v, int r){
        T[v].rt = r;
    }

    int getRight(int v){
        return T[v].rt;
    }

    void setDepth(int v, int dd){
        T[v].d = dd;
        if(T[v].rt != NIL) setDepth(T[v].rt, dd);
        if(T[v].lt != NIL) setDepth(T[v].lt, dd+1);
    }

    void printTree(int v){
        cout << "node " << v << ": ";
        cout << "parent = " << T[v].par << ", ";
        cout << "depth = " << T[v].d << ", ";

        if(T[v].par == NIL) cout << "root, ";
        else if(T[v].lt == NIL) cout << "leaf, ";
        else cout << "internal node, ";

        cout << "[";
        for(int i = 0, c = T[v].lt; c != NIL; c = T[c].rt, ++i){
            if(i) cout << ", ";
            cout << c;
        }
        cout << "]\n";
    }
};


int main(){
    int n; cin >> n;
    RootedTree T(n);
    REP(i, n){
        int id, k; cin >> id >> k;
        int l;
        REP(j, k){
            int c; cin >> c;
            if(!j) T.setLeft(id, c); 
            else T.setRight(l, c);
            l = c;
            T.setParent(c, id);
        }
    }
    int root = NIL;
    REP(i, n)
        if(T.getParent(i) == NIL) root = i;
    T.setDepth(root, 0);
    REP(i, n) T.printTree(i);
    return 0;
}



Measured memory_bytes: 5924