Please subscribe to the official Codeforces channel in Telegram via the link: https://t.me/codeforces_official.
×

No tag edit access

C. Cut 'em all!

time limit per test

1 secondmemory limit per test

256 megabytesinput

standard inputoutput

standard outputYou're given a tree with $$$n$$$ vertices.

Your task is to determine the maximum possible number of edges that can be removed in such a way that all the remaining connected components will have even size.

Input

The first line contains an integer $$$n$$$ ($$$1 \le n \le 10^5$$$) denoting the size of the tree.

The next $$$n - 1$$$ lines contain two integers $$$u$$$, $$$v$$$ ($$$1 \le u, v \le n$$$) each, describing the vertices connected by the $$$i$$$-th edge.

It's guaranteed that the given edges form a tree.

Output

Output a single integer $$$k$$$ — the maximum number of edges that can be removed to leave all connected components with even size, or $$$-1$$$ if it is impossible to remove edges in order to satisfy this property.

Examples

Input

4

2 4

4 1

3 1

Output

1

Input

3

1 2

1 3

Output

-1

Input

10

7 1

8 4

8 10

4 7

6 5

9 3

3 5

2 10

2 5

Output

4

Input

2

1 2

Output

0

Note

In the first example you can remove the edge between vertices $$$1$$$ and $$$4$$$. The graph after that will have two connected components with two vertices in each.

In the second example you can't remove edges in such a way that all components have even number of vertices, so the answer is $$$-1$$$.

Codeforces (c) Copyright 2010-2018 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Dec/12/2018 18:36:50 (d2).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|