D. Arpa’s letter-marked tree and Mehrdad’s Dokhtar-kosh paths(Hard)
time limit per test
2 seconds
memory limit per test
256 megabytes
input
standard input
output
standard output

Just in case somebody missed it: we have wonderful girls in Arpa’s land.

Arpa has a rooted tree (connected acyclic graph) consisting of n vertices. The vertex 1 is the root. There is a letter written on each edge of this tree. Mehrdad is a fan of Dokhtar-kosh things. He call a string Dokhtar-kosh, if we can shuffle the characters in string such that it becomes palindrome.

He asks Arpa, for each vertex v, what is the length of the longest simple path in subtree of v that form a Dokhtar-kosh string.

Input

The first line contains integer n (1  ≤  n  ≤  5·105) — the number of vertices in the tree.

(n  -  1) lines follow, the i-th of them contain an integer pi and a letter ci (1  ≤  pi  <  i, ci is lowercase English letter), that mean that there is an edge between nodes pi and i and there is a letter ci written on this edge.

Output

Print n integers. The i-th of them should be the length of the longest simple path in subtree of the i-th vertex that form a Dokhtar-kosh string.

Examples
Input
4
1 s
2 a
3 s
Output
3 1 1 0
Input
5
1 a
2 z
1 a
4 z
Output
4 1 0 1 0