#include <iostream>
#include <vector>
#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>;
template <class T>
using VV = V<V<T> >;


struct Node {
	int num = 0;
	Node* next[27] = { NULL };
};

struct Trie {
	Node* root = new Node;

	void add(V<int>& lis) {
		Node* last = root;
		for (auto i : lis) {
			if (last->next[i] == NULL) {
				last->next[i] = new Node;
			}
			last = last->next[i];
		}
		(last->num)++;
	}

	int search(V<int>& lis) {
		Node* last = root;
		for (auto i : lis) {
			if (last->next[i] == NULL) {
				return 0;
			}
			last = last->next[i];
		}
		return last->num;
	}
};


int main(void) {
	int n;	cin >> n;
	V<str> s(n);
	VV<int> lis(n, V<int>({}));
	Trie trie;
	rep(i, 0, n) {
		cin >> s[i];
		for (auto c : s[i]) {
			lis[i].push_back(c - 'a');
		}
		V<int> cl = lis[i];
		cl[0] = 26;
		trie.add(cl);
		rep(j, 1, cl.size()) {
			cl[j - 1] = lis[i][j - 1];
			cl[j] = 26;
			trie.add(cl);
		}
	}

	for (auto l : lis) {
		V<int> cl = l;
		int ans = 0;
		cl[0] = 26;
		ans += trie.search(cl) - 1;
		rep(j, 1, cl.size()) {
			cl[j - 1] = l[j - 1];
			cl[j] = 26;
			ans += trie.search(cl) - 1;
		}
		cout << ans << endl;
	}

	return 0;
}