#include <bits/stdc++.h>
using namespace std;

const int maxn = 350005;

vector<int> graph[maxn];
bool visited[maxn];
int segment_tree[3 * maxn];
vector<int> topological_sorting;
void dfs(int node) {
    visited[node] = true;
    for(int i = 0; i < (int) graph[node].size(); i++) {
        int neighbour = graph[node][i];
        if(!visited[neighbour]) {
            dfs(neighbour);
        }
    }

    topological_sorting.push_back(node);
}

void build_tree(int L, int R, int node) {
    if(L == R) {
        segment_tree[node] = 0;
    }
    else {
        int middle = (L + R) / 2;
        build_tree(L, middle, 2 * node);
        build_tree(middle + 1 ,R, 2 * node + 1);
        segment_tree[node] = segment_tree[2 * node] + segment_tree[2 * node + 1];
    }
}
// L R i j L R
int query(int i, int j, int L, int R, int node) {
    if(i <= L and R <= j) {
        return segment_tree[node];
    }
    if(R < i or j < L) {
        return 0;
    }

    int middle = (L + R) / 2;
    return query(i, j, L, middle, 2 * node) + query(i, j, middle + 1, R, 2 * node + 1);
}

void update(int idx, int new_value, int L, int R, int node) {
    if(L == R) {
        segment_tree[node] += new_value;
        return;
    }
    int middle = (L + R) / 2;

    if(idx <= middle) {
        update(idx, new_value, L, middle, 2 * node);
    }
    else {
        update(idx, new_value, middle + 1, R, 2 * node + 1);
    }
    segment_tree[node] = segment_tree[2 * node] + segment_tree[2 * node + 1];
}
int main()
{
    ios_base::sync_with_stdio(false);
    int n;
    cin >> n;

    for(int i = 0; i < n; i++) {
        char c;
        cin >> c;

        if(c == 'K') {
            graph[i + 1].push_back(i + 1);
        }
        else {
            int p;
            cin >> p;
            graph[p].push_back(i + 1);
        }
    }

    memset(visited, false, sizeof visited);

    for(int i = 1; i <= n; i++) {
        if(!visited[i]) {
            dfs(i);
        }
    }

    build_tree(0, n + 1, 1);

    vector<int> res(n + 1);
    for(int i = 0; i < n; i++) {
        update(topological_sorting[i], 1, 0, n + 1, 1);
        res[topological_sorting[i]] = query(0, topological_sorting[i], 0, n + 1, 1);
    }

    for(int i = 1; i <= n; i++) {
        cout << res[i] << "\n";
    }

    return 0;
}