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

В условии задачи недавно были сделаны правки. Просмотреть изменения.

×
F. Heaps

time limit per test

2.5 secondsmemory limit per test

512 megabytesinput

standard inputoutput

standard outputYou're given a tree with *n* vertices rooted at 1.

We say that there's a *k*-ary heap of depth *m* located at *u* if the following holds:

- For
*m*= 1*u*itself is a*k*-ary heap of depth 1. - For
*m*> 1 vertex*u*is a*k*-ary heap of depth*m*if at least*k*of its children are*k*-ary heaps of depth at least*m*- 1.

Denote *dp*_{k}(*u*) as maximum depth of *k*-ary heap in the subtree of *u* (including *u*). Your goal is to compute .

Input

The first line contains an integer *n* denoting the size of the tree (2 ≤ *n* ≤ 3·10^{5}).

The next *n* - 1 lines contain two integers *u*, *v* each, describing vertices connected by *i*-th edge.

It's guaranteed that the given configuration forms a tree.

Output

Output the answer to the task.

Examples

Input

4

1 3

2 3

4 3

Output

21

Input

4

1 2

2 3

3 4

Output

22

Note

Consider sample case one.

For *k* ≥ 3 all *dp*_{k} will be equal to 1.

For *k* = 2 *dp*_{k} is 2 if and 1 otherwise.

For *k* = 1 *dp*_{k} values are (3, 1, 2, 1) respectively.

To sum up, 4·1 + 4·1 + 2·2 + 2·1 + 3 + 1 + 2 + 1 = 21.

Codeforces (c) Copyright 2010-2020 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Sep/27/2020 22:50:44 (f3).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|