// TLE

#include <iostream>
#include <vector>
#include <map>
#define rep(i, l, n) for (int i = (l); i < (n); i++)
using namespace std;
using str = string;
template <class T>
using V = vector<T>;


int main(void) {
	int n;	cin >> n;
	V<str> s(n);
	rep(i, 0, n) {
		cin >> s[i];
	}

	V<int> ans(n);
	rep(i, 0, n - 1) {
		rep(j, i + 1, n) {
			if (s[i].size() != s[j].size()) {
				continue;
			}
			int cnt = 0;
			rep(k, 0, s[i].size()) {
				if (s[i][k] != s[j][k]) {
					cnt++;
				}
				if (cnt > 1) {
					break;
				}
			}
			if (cnt > 1) {
				continue;
			}
			ans[i]++;	ans[j]++;
		}
	}

	rep(i, 0, n) {
		cout << ans[i] << endl;
	}

	return 0;
}