Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ICPC mode for virtual contests.
If you've seen these problems, a virtual contest is not for you - solve these problems in the archive.
If you just want to solve some problem from a contest, a virtual contest is not for you - solve this problem in the archive.
Never use someone else's code, read the tutorials or communicate with other person during a virtual contest.

No tag edit access

The problem statement has recently been changed. View the changes.

×
E. Ants in Leaves

time limit per test

2 secondsmemory limit per test

256 megabytesinput

standard inputoutput

standard outputTree is a connected graph without cycles. A leaf of a tree is any vertex connected with exactly one other vertex.

You are given a tree with *n* vertices and a root in the vertex 1. There is an ant in each leaf of the tree. In one second some ants can simultaneously go to the parent vertex from the vertex they were in. No two ants can be in the same vertex simultaneously except for the root of the tree.

Find the minimal time required for all ants to be in the root of the tree. Note that at start the ants are only in the leaves of the tree.

Input

The first line contains integer *n* (2 ≤ *n* ≤ 5·10^{5}) — the number of vertices in the tree.

Each of the next *n* - 1 lines contains two integers *x*_{i}, *y*_{i} (1 ≤ *x*_{i}, *y*_{i} ≤ *n*) — the ends of the *i*-th edge. It is guaranteed that you are given the correct undirected tree.

Output

Print the only integer *t* — the minimal time required for all ants to be in the root of the tree.

Examples

Input

12

1 2

1 3

1 4

2 5

2 6

3 7

3 8

3 9

8 10

8 11

8 12

Output

6

Input

2

2 1

Output

1

Codeforces (c) Copyright 2010-2022 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: May/23/2022 23:36:36 (f1).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|