static void Main()
{
FileStream fs = new FileStream("output.txt", FileMode.Create, FileAccess.Write);
StreamWriter sw = new StreamWriter(fs);
Console.SetOut(sw);
string[] stdin = File.ReadAllLines("input.txt");
bool isCorrect = true;
long N = long.Parse(stdin[0]);
AvlTree <long>[] nodes = new AvlTree <long> [N];
List <AvlTree <long> > leafs = new List <AvlTree <long> >();
//Parsing
for (int i = 1; i <= N && isCorrect; i++)
{
long[] args = stdin[i].Split(' ').Select(x => long.Parse(x)).ToArray();
if (nodes[i - 1] == null)
{
nodes[i - 1] = new AvlTree <long>();
}
nodes[i - 1].Key = args[0];
//Left child
if (args[1] != 0)
{
if (nodes[args[1] - 1] == null)
{
nodes[args[1] - 1] = new AvlTree <long>()
{
Parent = nodes[i - 1]
}
}
;
nodes[i - 1].Left = nodes[args[1] - 1];
}
//Right child
if (args[2] != 0)
{
if (args[2] != 0 && nodes[args[2] - 1] == null)
{
nodes[args[2] - 1] = new AvlTree <long>()
{
Parent = nodes[i - 1]
}
}
;
nodes[i - 1].Right = nodes[args[2] - 1];
}
//Calc Height
if (args[1] == 0 & args[2] == 0)
{
AvlTree <long> leaf = nodes[i - 1];
Stack <AvlTree <long> > temp = new Stack <AvlTree <long> >();
while (leaf != null)
{
temp.Push(leaf);
leaf = leaf.Parent;
}
while (temp.Count != 0)
{
leaf = temp.Pop();
if (leaf.Height < temp.Count)
{
leaf.Height = temp.Count;
}
}
}
}
for (int i = 0; i < N; i++)
{
Console.WriteLine(AvlTree <long> .GetBalance(nodes[i]));
}
sw.Dispose();
}
}