跳到主要内容
图灵 OJTURING / ONLINE JUDGE

#F1172. Tree of Life (easy)

  • ID: 1178
  • 传统题
  • 2000ms
  • 256MiB
  • 尝试: 0
  • AC · 已通过: 0
  • 教学难度:基础
  • 上传者:
  • 树
  • 图论
  • 数据结构
  • 基础
  • 难度
  • 共享题库
  • Codeforces
  • 英文题面
  • 题目来源
  • 题面语言

Tree of Life (easy)

题目描述

F1. Tree of Life (easy)
time limit per test
2 seconds
memory limit per test
256 megabytes
input
standard input
output
standard output

Heidi has finally found the mythical Tree of Life — a legendary combinatorial structure which is said to contain a prophecy crucially needed to defeat the undead armies.

On the surface, the Tree of Life is just a regular undirected tree well-known from computer science. This means that it is a collection of n points (called vertices), some of which are connected using n-1 line segments (edges) so that each pair of vertices is connected by a path (a sequence of one or more edges).

To decipher the prophecy, Heidi needs to perform a number of steps. The first is counting the number of lifelines in the tree — these are paths of length 2, i.e., consisting of two edges. Help her!

Input

The first line of the input contains a single integer n — the number of vertices in the tree (1≤n≤10000). The vertices are labeled with the numbers from 1 to n. Then n-1 lines follow, each describing one edge using two space-separated numbers a b — the labels of the vertices connected by the edge (1≤a<b≤n). It is guaranteed that the input represents a tree.

Output

Print one integer — the number of lifelines in the tree.

Examples
Input
4
1 2
1 3
1 4
Output
3
Input
5
1 2
2 3
3 4
3 5
Output
4
Note

In the second sample, there are four lifelines: paths between vertices 1 and 3, 2 and 4, 2 and 5, and 4 and 5.


题目来源:fps-www.educg.net-codeforce-1-2833.xml.zip;FPS 共享题包,题包内第 645 题。保留原作者与原赛事署名。