// Template {{{
#include <bits/stdc++.h>
#define REP(i,n) for(int i=0; i<(int)(n); ++i)
using namespace std;
typedef long long LL;

#ifdef LOCAL
#include "contest.h"
#else
#define dump(x) 
#endif

class range {
    struct Iterator {
        int val, inc;
        int operator*() {return val;}
        bool operator!=(Iterator& rhs) {return val < rhs.val;}
        void operator++() {val += inc;}
    };
    Iterator i, n;
    public:
    range(int e) : i({0, 1}), n({e, 1}) {}
    range(int b, int e) : i({b, 1}), n({e, 1}) {}
    range(int b, int e, int inc) : i({b, inc}), n({e, inc}) {}
    Iterator& begin() {return i;}
    Iterator& end() {return n;}
};

const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
inline bool valid(int x, int w) { return 0 <= x && x < w; }

void iostream_init() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.setf(ios::fixed);
    cout.precision(12);
}
//}}}

vector<vector<int>> next_v;
vector<string> word;
void dfs(int u, int d) {
    if(u != 0) {
        string s = string(d-1, '.') + word[u-1];
        cout << s << endl;
    }
    for(int v : next_v[u]) {
        dfs(v, d+1);
    }

}
int main(){
    iostream_init();
    int N;
    while(cin >> N) {
        next_v.resize(N+1);
        REP(i, N) {
            int K;
            cin >> K;
            string s;
            cin >> s;
            word.push_back(s);
            next_v[K].push_back(i+1);
        }
        dfs(0, 0);
    }
    return 0;
}

/* vim:set foldmethod=marker: */