#include <cstdio>
#include <iostream>
#include <string>
#include <sstream>
#include <stack>
#include <algorithm>
#include <cmath>
#include <queue>
#include <map>
#include <set>
#include <cstdlib>
#include <bitset>
#include <tuple>
#include <assert.h>
#include <deque>
#include <bitset>
#include <iomanip>
#include <limits>
#include <chrono>
#include <random>
#include <array>
#include <unordered_map>
#include <functional>
#include <complex>
#include <numeric>
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }

constexpr long long MAX = 5100000;
constexpr long long INF = 1LL << 60;
constexpr int inf = 1 << 28;
constexpr long long mod = 1000000007LL;
//constexpr long long mod = 998244353LL;

using namespace std;
typedef unsigned long long ull;
typedef long long ll;

int n;
vector<vector<int>> g;
vector<string> vs;
void dfs(int cur, int p) {
	for (int i = 0; i < p; i++)cout << ".";
	cout << vs[cur] << "\n";
	for (int i = 0; i < g[cur].size(); i++) {
		dfs(g[cur][i], p + 1);
	}
}
int main()
{
	/*
	cin.tie(nullptr);
	ios::sync_with_stdio(false);
	*/

	int kkt = 1;
	while (kkt--) {
		scanf("%d", &n);
		g.resize(n);
		vs.resize(n);
		for (int i = 0; i < n; i++) {
			int p; scanf("%d", &p);
			cin >> vs[i];
			if (p != 0) {
				p--;
				g[p].push_back(i);
			}
		}
		dfs(0, 0);
	}
	return 0;

}

