#include <iostream>
#include <vector>
#include <cmath>
#include <map>
#include <set>
#include <iomanip>
#include <queue>
#include <algorithm>
#include <numeric>
#include <deque>
#include <complex>
#include <cassert>

using namespace std;
using ll = long long;

int main(){

    int N;
    cin >> N;
    vector<string> S(N);
    vector<int> C(N), cnt(8);
    set<string> st;
    for (int i=0; i<N; i++) cin >> S[i] >> C[i];

    for (int i=N-1; i>=0; i--){
        if (st.count(S[i])) continue;
        st.insert(S[i]);
        cnt[C[i]]++;
    }

    for (int i=0; i<=7; i++) cout << cnt[i] << endl;

    return 0;
}