862B Mahmoud and Ehab and the bipartiteness （黑白染色）

Mahmoud and Ehab continue their adventures! As everybody in the evil land knows, Dr. Evil likes bipartite graphs, especially trees.

A tree is a connected acyclic graph. A bipartite graph is a graph, whose vertices can be partitioned into 2 sets in such a way, that for each edge (u, v) that belongs to the graph, u and v belong to different sets. You can find more formal definitions of a tree and a bipartite graph in the notes section below.

Dr. Evil gave Mahmoud and Ehab a tree consisting of n nodes and asked them to add edges to it in such a way, that the graph is still bipartite. Besides, after adding these edges the graph should be simple (doesn't contain loops or multiple edges). What is the maximum number of edges they can add?

A loop is an edge, which connects a node with itself. Graph doesn't contain multiple edges when for each pair of nodes there is no more than one edge between them. A cycle and a loop aren't the same .

Input

The first line of input contains an integer n — the number of nodes in the tree (1 ≤ n ≤ 10⁵).

The next n - 1 lines contain integers u and v (1 ≤ u, v ≤ n, u ≠ v) — the description of the edges of the tree.

It's guaranteed that the given graph is a tree.

Output

Output one integer — the maximum number of edges that Mahmoud and Ehab can add to the tree while fulfilling the conditions.

Examples

Input

3
1 2
1 3

Output

0

Input

5
1 2
2 3
3 4
4 5

Output

2

Note

Tree definition: https://en.wikipedia.org/wiki/Tree_(graph_theory)

Bipartite graph definition: https://en.wikipedia.org/wiki/Bipartite_graph

In the first test case the only edge that can be added in such a way, that graph won't contain loops or multiple edges is (2, 3), but adding this edge will make the graph non-bipartite so the answer is 0.

In the second test case Mahmoud and Ehab can add edges (1, 4) and (2, 5).

题意：

给你n个点n-1条边的树，问你最多加几条边，让这个图不存在环，重边，并且是一个二分图

思路：由于题目限制，我们可以首先对他进行黑白染色，把这棵树变成一个二分图，那么我们就能得到两个点集，假设我们的点集分别是 ans1，ans2，那么我们总共可以连接 ans1*ans2条边，然后减去我们已经有的边n+1，就是答案，当时在写的时候 ，题意读不懂，，，卒。。。比较坑的一点是需要开longlong,而且点数为1e5所以需要用链式向前星去存图

#include<iostream>

#includ<stdio.h>
#include<algorithm>
#include<string.h>
using namespace std;
const int maxn = 1e6;

struct node
{
	int to,next;
}edg[maxn];

int cnt=0,head[maxn*2],vis[2*maxn];
void add(int u,int v)
{
	edg[cnt].to=v;
	edg[cnt].next=head[u]++;
	head[u]=cnt++;
}
void dfs(int x,int flag)
{
	for(int i=head[x];i!=-1;i=edg[i].next)
	{
		int v=edg[i].to;
		if(vis[v]==-1)
		{
			vis[v]=flag;
			dfs(v,!flag);
		}
	}
}
int main()
{
	int n,a,b;
	cin>>n;
	cnt=0;
	memset(head,-1,sizeof(head));
	memset(vis,-1,sizeof(vis));
	for(int i=0;i<n-1;i++)
	{
		cin>>a>>b;
		add(a,b);
		add(b,a);
	}
	dfs(1,0);
	long long ans1=0,ans2=0;
	for(int i=1;i<=n;i++)
	{
		if(vis[i]==1)
		{
			ans1++;
		}
		if(vis[i]==0)
		{
			ans2++;
		}
	}
	long long ans=(ans1*ans2-n+1);
	cout<<ans;
	
}