Treeland is a country with $n$ cities and $n-1$ roads. There is exactly one path between any two cities.  

The ruler of Treeland wants to implement a self-driving bus system and asks tree-loving Alex to plan the bus routes. Alex decides that each route must contain a subset of connected cities; a subset of cities is connected if the following two conditions are true:

There is a path between every pair of cities which belongs to the subset.
Every city in the path must belong to the subset.

In the figure above, $\{2,3,4,5\}$ is a connected subset, but $\{6,7,9\}$ is not  (for the second condition to be true, $8$ would need to be part of the subset).

Each self-driving bus will operate within a connected segment of Treeland. A connected segment $[L,R]$ where $1\leq L\leq R\leq n$ is defined by the connected subset of cities $S=\{x\ |x\in Z\ \text{and}\ \ L\leq x\leq R\}$. 

In the figure above, $[2,5]$ is a connected segment that represents the subset $\{2,3,4,5\}$. Note that a single city can be a segment too.

Help Alex to find number of connected segments in Treeland.

Input Format

The first line contains a single positive integer, $n$. 
The $n-1$ subsequent lines each contain two positive space-separated integers, $a_i$ and $b_i$, describe an edge connecting two nodes in tree $\mathbf{T}$.

Constraints

$1\leq n\leq2\times10^5$

$1\leq a_i,b_i\leq n$

Subtasks    

For $25\%$ score: $1\leq n\leq2\times10^3$

For $50\%$ score: $1\leq n\leq10^4$

Output Format

Print a single integer: the number of segments $[L,R]$, which are connected in tree $\mathbf{T}$.

Sample Input
3
1 3
3 2

Sample Output
5

Explanation

The connected segments for our test case are: $[1,1]$, $[2,2]$, $[3,3]$, $[2,3]$, and $[1,3]$. These segments can be represented by the respective subsets: $\{1\}$, $\{2\}$, $\{3\}$, $\{2,3\}$, and $\{1,2,3\}$.

Note: $[1,2]$ is not a connected segment. It represents the subset $\{1,2\}$ and the path between $1$ and $2$ goes through $3$ which is not a member of the subset.

Difficulty: HARD

Solutions:
from heapq import *
n = int(input())
neighbors = {}
for x in range(n):
	neighbors[x] = []
for i in range(n - 1):
	(a, b) = map(int, input().split())
	neighbors[a - 1].append(b - 1)
	neighbors[b - 1].append(a - 1)

def search(source):
	ans = 0
	cur_max = 0
	cur_len = 0
	heap = [source]
	vis = [False for i in range(n)]
	while len(heap) > 0:
		x = heappop(heap)
		cur_max = max(cur_max, x)
		cur_len += 1
		vis[x] = True
		if cur_max - source + 1 == cur_len:
			ans += 1
		for y in neighbors[x]:
			if y >= source and vis[y] == False:
				heappush(heap, y)
	return ans
ans = 0
prev = 0
for x in range(n - 1, -1, -1):
	neigh = 0
	plus = 0
	for y in neighbors[x]:
		if y > x:
			neigh += 1
		if y == x + 1:
			plus = 1
	if plus == neigh and plus == 1:
		prev += 1
	else:
		prev = search(x)
	ans += prev
print(ans)


from heapq import *
n = int(input())
neighbors = {}
for x in range(n):
	neighbors[x] = []
for i in range(n - 1):
	(a, b) = map(int, input().split())
	neighbors[a - 1].append(b - 1)
	neighbors[b - 1].append(a - 1)

def search(source):
	ans = 0
	cur_max = 0
	cur_len = 0
	heap = [source]
	vis = [False for i in range(n)]
	while len(heap) > 0:
		x = heappop(heap)
		cur_max = max(cur_max, x)
		cur_len += 1
		vis[x] = True
		if cur_max - source + 1 == cur_len:
			ans += 1
		for y in neighbors[x]:
			if y >= source and vis[y] == False:
				heappush(heap, y)
	return ans
ans = 0
prev = 0
for x in range(n - 1, -1, -1):
	neigh = 0
	plus = 0
	for y in neighbors[x]:
		if y > x:
			neigh += 1
		if y == x + 1:
			plus = 1
	if plus == neigh and plus == 1:
		prev += 1
	else:
		prev = search(x)
	ans += prev
print(ans)


from heapq import *

def func(source):
	ans = 0
	cmax = 0
	clen = 0
	heap = [source]
	visited = [False for i in range(n)]
	while len(heap) > 0:
		x = heappop(heap)
		cmax = max(cmax, x)
		clen += 1
		visited[x] = True
		if cmax - source + 1 == clen:
			ans += 1
		for y in neighbors[x]:
			if y >= source and visited[y] == False:
				heappush(heap, y)
	return ans
n = int(input())
neighbors = {}
for i in range(n):
	neighbors[i] = []
for i in range(n - 1):
	(a, b) = map(int, input().split())
	neighbors[a - 1].append(b - 1)
	neighbors[b - 1].append(a - 1)
ans = 0
previous = 0
for i in range(n - 1, -1, -1):
	neigh = 0
	plus = 0
	for y in neighbors[i]:
		if y > i:
			neigh += 1
		if y == i + 1:
			plus = 1
	if plus == neigh and plus == 1:
		previous += 1
	else:
		previous = func(i)
	ans += previous
print(ans)


from heapq import *
n = int(input())
neighbors = {}
for x in range(n):
	neighbors[x] = []
for i in range(n - 1):
	(a, b) = map(int, input().split())
	neighbors[a - 1].append(b - 1)
	neighbors[b - 1].append(a - 1)

def search(source):
	ans = 0
	cur_max = 0
	cur_len = 0
	heap = [source]
	vis = [False for i in range(n)]
	while len(heap) > 0:
		x = heappop(heap)
		cur_max = max(cur_max, x)
		cur_len += 1
		vis[x] = True
		if cur_max - source + 1 == cur_len:
			ans += 1
		for y in neighbors[x]:
			if y >= source and vis[y] == False:
				heappush(heap, y)
	return ans
ans = 0
prev = 0
for x in range(n - 1, -1, -1):
	neigh = 0
	plus = 0
	for y in neighbors[x]:
		if y > x:
			neigh += 1
		if y == x + 1:
			plus = 1
	if plus == neigh and plus == 1:
		prev += 1
	else:
		prev = search(x)
	ans += prev
print(ans)


from heapq import *
n = int(input())
neighbors = {}
for x in range(n):
	neighbors[x] = []
for i in range(n - 1):
	(a, b) = map(int, input().split())
	neighbors[a - 1].append(b - 1)
	neighbors[b - 1].append(a - 1)

def search(source):
	ans = 0
	cur_max = 0
	cur_len = 0
	heap = [source]
	vis = [False for i in range(n)]
	while len(heap) > 0:
		x = heappop(heap)
		cur_max = max(cur_max, x)
		cur_len += 1
		vis[x] = True
		if cur_max - source + 1 == cur_len:
			ans += 1
		for y in neighbors[x]:
			if y >= source and vis[y] == False:
				heappush(heap, y)
	return ans
ans = 0
prev = 0
for x in range(n - 1, -1, -1):
	neigh = 0
	plus = 0
	for y in neighbors[x]:
		if y > x:
			neigh += 1
		if y == x + 1:
			plus = 1
	if plus == neigh and plus == 1:
		prev += 1
	else:
		prev = search(x)
	ans += prev
print(ans)


from heapq import *
n = int(input())
neighbors = {}
for x in range(n):
	neighbors[x] = []
for i in range(n - 1):
	(a, b) = map(int, input().split())
	neighbors[a - 1].append(b - 1)
	neighbors[b - 1].append(a - 1)

def search(source):
	ans = 0
	cur_max = 0
	cur_len = 0
	heap = [source]
	vis = [False for i in range(n)]
	while len(heap) > 0:
		x = heappop(heap)
		cur_max = max(cur_max, x)
		cur_len += 1
		vis[x] = True
		if cur_max - source + 1 == cur_len:
			ans += 1
		for y in neighbors[x]:
			if y >= source and vis[y] == False:
				heappush(heap, y)
	return ans
ans = 0
prev = 0
for x in range(n - 1, -1, -1):
	neigh = 0
	plus = 0
	for y in neighbors[x]:
		if y > x:
			neigh += 1
		if y == x + 1:
			plus = 1
	if plus == neigh and plus == 1:
		prev += 1
	else:
		prev = search(x)
	ans += prev
print(ans)


from heapq import *
n = int(input())
neighbors = {}
for x in range(n):
	neighbors[x] = []
for i in range(n - 1):
	(a, b) = map(int, input().split())
	neighbors[a - 1].append(b - 1)
	neighbors[b - 1].append(a - 1)

def search(source):
	ans = 0
	cur_max = 0
	cur_len = 0
	heap = [source]
	vis = [False for i in range(n)]
	while len(heap) > 0:
		x = heappop(heap)
		cur_max = max(cur_max, x)
		cur_len += 1
		vis[x] = True
		if cur_max - source + 1 == cur_len:
			ans += 1
		for y in neighbors[x]:
			if y >= source and vis[y] == False:
				heappush(heap, y)
	return ans
ans = 0
prev = 0
for x in range(n - 1, -1, -1):
	neigh = 0
	plus = 0
	for y in neighbors[x]:
		if y > x:
			neigh += 1
		if y == x + 1:
			plus = 1
	if plus == neigh and plus == 1:
		prev += 1
	else:
		prev = search(x)
	ans += prev
print(ans)


from heapq import *
n = int(input())
neighbors = {}
for x in range(n):
	neighbors[x] = []
for i in range(n - 1):
	(a, b) = map(int, input().split())
	neighbors[a - 1].append(b - 1)
	neighbors[b - 1].append(a - 1)

def search(source):
	ans = 0
	cur_max = 0
	cur_len = 0
	heap = [source]
	vis = [False for i in range(n)]
	while len(heap) > 0:
		x = heappop(heap)
		cur_max = max(cur_max, x)
		cur_len += 1
		vis[x] = True
		if cur_max - source + 1 == cur_len:
			ans += 1
		for y in neighbors[x]:
			if y >= source and vis[y] == False:
				heappush(heap, y)
	return ans
ans = 0
prev = 0
for x in range(n - 1, -1, -1):
	neigh = 0
	plus = 0
	for y in neighbors[x]:
		if y > x:
			neigh += 1
		if y == x + 1:
			plus = 1
	if plus == neigh and plus == 1:
		prev += 1
	else:
		prev = search(x)
	ans += prev
print(ans)


from heapq import *
n = int(input())
neighbors = {}
for x in range(n):
	neighbors[x] = []
for i in range(n - 1):
	(a, b) = map(int, input().split())
	neighbors[a - 1].append(b - 1)
	neighbors[b - 1].append(a - 1)

def search(source):
	ans = 0
	cur_max = 0
	cur_len = 0
	heap = [source]
	vis = [False for i in range(n)]
	while len(heap) > 0:
		x = heappop(heap)
		cur_max = max(cur_max, x)
		cur_len += 1
		vis[x] = True
		if cur_max - source + 1 == cur_len:
			ans += 1
		for y in neighbors[x]:
			if y >= source and vis[y] == False:
				heappush(heap, y)
	return ans
ans = 0
prev = 0
for x in range(n - 1, -1, -1):
	neigh = 0
	plus = 0
	for y in neighbors[x]:
		if y > x:
			neigh += 1
		if y == x + 1:
			plus = 1
	if plus == neigh and plus == 1:
		prev += 1
	else:
		prev = search(x)
	ans += prev
print(ans)


from heapq import *
n = int(input())
neighbors = {}
for x in range(n):
	neighbors[x] = []
for i in range(n - 1):
	(a, b) = map(int, input().split())
	neighbors[a - 1].append(b - 1)
	neighbors[b - 1].append(a - 1)

def search(source):
	ans = 0
	cur_max = 0
	cur_len = 0
	heap = [source]
	vis = [False for i in range(n)]
	while len(heap) > 0:
		x = heappop(heap)
		cur_max = max(cur_max, x)
		cur_len += 1
		vis[x] = True
		if cur_max - source + 1 == cur_len:
			ans += 1
		for y in neighbors[x]:
			if y >= source and vis[y] == False:
				heappush(heap, y)
	return ans
ans = 0
prev = 0
for x in range(n - 1, -1, -1):
	neigh = 0
	plus = 0
	for y in neighbors[x]:
		if y > x:
			neigh += 1
		if y == x + 1:
			plus = 1
	if plus == neigh and plus == 1:
		prev += 1
	else:
		prev = search(x)
	ans += prev
print(ans)


import math
import os
import random
import re
import sys
from heapq import *
n = int(input())
neighbors = {}
for x in range(n):
	neighbors[x] = []
for i in range(n - 1):
	(a, b) = map(int, input().split())
	neighbors[a - 1].append(b - 1)
	neighbors[b - 1].append(a - 1)

def search(source):
	ans = 0
	cur_max = 0
	cur_len = 0
	heap = [source]
	vis = [False for i in range(n)]
	while len(heap) > 0:
		x = heappop(heap)
		cur_max = max(cur_max, x)
		cur_len += 1
		vis[x] = True
		if cur_max - source + 1 == cur_len:
			ans += 1
		for y in neighbors[x]:
			if y >= source and vis[y] == False:
				heappush(heap, y)
	return ans
ans = 0
prev = 0
for x in range(n - 1, -1, -1):
	neigh = 0
	plus = 0
	for y in neighbors[x]:
		if y > x:
			neigh += 1
		if y == x + 1:
			plus = 1
	if plus == neigh and plus == 1:
		prev += 1
	else:
		prev = search(x)
	ans += prev
print(ans)


from heapq import *
n = int(input())
neighbors = {}
for x in range(n):
	neighbors[x] = []
for i in range(n - 1):
	(a, b) = map(int, input().split())
	neighbors[a - 1].append(b - 1)
	neighbors[b - 1].append(a - 1)

def search(source):
	ans = 0
	cur_max = 0
	cur_len = 0
	heap = [source]
	vis = [False for i in range(n)]
	while len(heap) > 0:
		x = heappop(heap)
		cur_max = max(cur_max, x)
		cur_len += 1
		vis[x] = True
		if cur_max - source + 1 == cur_len:
			ans += 1
		for y in neighbors[x]:
			if y >= source and vis[y] == False:
				heappush(heap, y)
	return ans
ans = 0
prev = 0
for x in range(n - 1, -1, -1):
	neigh = 0
	plus = 0
	for y in neighbors[x]:
		if y > x:
			neigh += 1
		if y == x + 1:
			plus = 1
	if plus == neigh and plus == 1:
		prev += 1
	else:
		prev = search(x)
	ans += prev
print(ans)


from heapq import *
n = int(input())
neighbors = {}
for x in range(n):
	neighbors[x] = []
for i in range(n - 1):
	(a, b) = map(int, input().split())
	neighbors[a - 1].append(b - 1)
	neighbors[b - 1].append(a - 1)

def search(source):
	ans = 0
	cur_max = 0
	cur_len = 0
	heap = [source]
	vis = [False for i in range(n)]
	while len(heap) > 0:
		x = heappop(heap)
		cur_max = max(cur_max, x)
		cur_len += 1
		vis[x] = True
		if cur_max - source + 1 == cur_len:
			ans += 1
		for y in neighbors[x]:
			if y >= source and vis[y] == False:
				heappush(heap, y)
	return ans
ans = 0
prev = 0
for x in range(n - 1, -1, -1):
	neigh = 0
	plus = 0
	for y in neighbors[x]:
		if y > x:
			neigh += 1
		if y == x + 1:
			plus = 1
	if plus == neigh and plus == 1:
		prev += 1
	else:
		prev = search(x)
	ans += prev
print(ans)


from heapq import *
n = int(input())
neighbors = {}
for x in range(n):
	neighbors[x] = []
for i in range(n - 1):
	(a, b) = map(int, input().split())
	neighbors[a - 1].append(b - 1)
	neighbors[b - 1].append(a - 1)

def search(source):
	ans = 0
	cur_max = 0
	cur_len = 0
	heap = [source]
	vis = [False for i in range(n)]
	while len(heap) > 0:
		x = heappop(heap)
		cur_max = max(cur_max, x)
		cur_len += 1
		vis[x] = True
		if cur_max - source + 1 == cur_len:
			ans += 1
		for y in neighbors[x]:
			if y >= source and vis[y] == False:
				heappush(heap, y)
	return ans
ans = 0
prev = 0
for x in range(n - 1, -1, -1):
	neigh = 0
	plus = 0
	for y in neighbors[x]:
		if y > x:
			neigh += 1
		if y == x + 1:
			plus = 1
	if plus == neigh and plus == 1:
		prev += 1
	else:
		prev = search(x)
	ans += prev
print(ans)


from heapq import *
n = int(input())
neighbors = {}
for x in range(n):
	neighbors[x] = []
for i in range(n - 1):
	(a, b) = map(int, input().split())
	neighbors[a - 1].append(b - 1)
	neighbors[b - 1].append(a - 1)

def search(source):
	ans = 0
	cur_max = 0
	cur_len = 0
	heap = [source]
	vis = [False for i in range(n)]
	while len(heap) > 0:
		x = heappop(heap)
		cur_max = max(cur_max, x)
		cur_len += 1
		vis[x] = True
		if cur_max - source + 1 == cur_len:
			ans += 1
		for y in neighbors[x]:
			if y >= source and vis[y] == False:
				heappush(heap, y)
	return ans
ans = 0
prev = 0
for x in range(n - 1, -1, -1):
	neigh = 0
	plus = 0
	for y in neighbors[x]:
		if y > x:
			neigh += 1
		if y == x + 1:
			plus = 1
	if plus == neigh and plus == 1:
		prev += 1
	else:
		prev = search(x)
	ans += prev
print(ans)


import math
import os
import random
import re
import sys
from heapq import *
n = int(input())
neighbors = {}
for x in range(n):
	neighbors[x] = []
for i in range(n - 1):
	(a, b) = map(int, input().split())
	neighbors[a - 1].append(b - 1)
	neighbors[b - 1].append(a - 1)

def search(source):
	ans = 0
	cur_max = 0
	cur_len = 0
	heap = [source]
	vis = [False for i in range(n)]
	while len(heap) > 0:
		x = heappop(heap)
		cur_max = max(cur_max, x)
		cur_len += 1
		vis[x] = True
		if cur_max - source + 1 == cur_len:
			ans += 1
		for y in neighbors[x]:
			if y >= source and vis[y] == False:
				heappush(heap, y)
	return ans
ans = 0
prev = 0
for x in range(n - 1, -1, -1):
	neigh = 0
	plus = 0
	for y in neighbors[x]:
		if y > x:
			neigh += 1
		if y == x + 1:
			plus = 1
	if plus == neigh and plus == 1:
		prev += 1
	else:
		prev = search(x)
	ans += prev
print(ans)


from heapq import *
n = int(input())
neighbors = {}
for x in range(n):
	neighbors[x] = []
for i in range(n - 1):
	(a, b) = map(int, input().split())
	neighbors[a - 1].append(b - 1)
	neighbors[b - 1].append(a - 1)

def search(source):
	ans = 0
	cur_max = 0
	cur_len = 0
	heap = [source]
	vis = [False for i in range(n)]
	while len(heap) > 0:
		x = heappop(heap)
		cur_max = max(cur_max, x)
		cur_len += 1
		vis[x] = True
		if cur_max - source + 1 == cur_len:
			ans += 1
		for y in neighbors[x]:
			if y >= source and vis[y] == False:
				heappush(heap, y)
	return ans
ans = 0
prev = 0
for x in range(n - 1, -1, -1):
	neigh = 0
	plus = 0
	for y in neighbors[x]:
		if y > x:
			neigh += 1
		if y == x + 1:
			plus = 1
	if plus == neigh and plus == 1:
		prev += 1
	else:
		prev = search(x)
	ans += prev
print(ans)


from heapq import *
n = int(input())
neighbors = {}
for x in range(n):
	neighbors[x] = []
for i in range(n - 1):
	(a, b) = map(int, input().split())
	neighbors[a - 1].append(b - 1)
	neighbors[b - 1].append(a - 1)

def search(source):
	ans = 0
	cur_max = 0
	cur_len = 0
	heap = [source]
	vis = [False for i in range(n)]
	while len(heap) > 0:
		x = heappop(heap)
		cur_max = max(cur_max, x)
		cur_len += 1
		vis[x] = True
		if cur_max - source + 1 == cur_len:
			ans += 1
		for y in neighbors[x]:
			if y >= source and vis[y] == False:
				heappush(heap, y)
	return ans
ans = 0
prev = 0
for x in range(n - 1, -1, -1):
	neigh = 0
	plus = 0
	for y in neighbors[x]:
		if y > x:
			neigh += 1
		if y == x + 1:
			plus = 1
	if plus == neigh and plus == 1:
		prev += 1
	else:
		prev = search(x)
	ans += prev
print(ans)


from heapq import *
n = int(input())
neighbors = {}
for x in range(n):
	neighbors[x] = []
for i in range(n - 1):
	(a, b) = map(int, input().split())
	neighbors[a - 1].append(b - 1)
	neighbors[b - 1].append(a - 1)

def search(source):
	ans = 0
	cur_max = 0
	cur_len = 0
	heap = [source]
	vis = [False for i in range(n)]
	while len(heap) > 0:
		x = heappop(heap)
		cur_max = max(cur_max, x)
		cur_len += 1
		vis[x] = True
		if cur_max - source + 1 == cur_len:
			ans += 1
		for y in neighbors[x]:
			if y >= source and vis[y] == False:
				heappush(heap, y)
	return ans
ans = 0
prev = 0
for x in range(n - 1, -1, -1):
	neigh = 0
	plus = 0
	for y in neighbors[x]:
		if y > x:
			neigh += 1
		if y == x + 1:
			plus = 1
	if plus == neigh and plus == 1:
		prev += 1
	else:
		prev = search(x)
	ans += prev
print(ans)


from heapq import *
n = int(input())
neighbors = {}
for x in range(n):
	neighbors[x] = []
for i in range(n - 1):
	(a, b) = map(int, input().split())
	neighbors[a - 1].append(b - 1)
	neighbors[b - 1].append(a - 1)

def search(source):
	ans = 0
	cur_max = 0
	cur_len = 0
	heap = [source]
	vis = [False for i in range(n)]
	while len(heap) > 0:
		x = heappop(heap)
		cur_max = max(cur_max, x)
		cur_len += 1
		vis[x] = True
		if cur_max - source + 1 == cur_len:
			ans += 1
		for y in neighbors[x]:
			if y >= source and vis[y] == False:
				heappush(heap, y)
	return ans
ans = 0
prev = 0
for x in range(n - 1, -1, -1):
	neigh = 0
	plus = 0
	for y in neighbors[x]:
		if y > x:
			neigh += 1
		if y == x + 1:
			plus = 1
	if plus == neigh and plus == 1:
		prev += 1
	else:
		prev = search(x)
	ans += prev
print(ans)


from heapq import *
n = int(input())
neighbors = {}
for x in range(n):
	neighbors[x] = []
for i in range(n - 1):
	(a, b) = map(int, input().split())
	neighbors[a - 1].append(b - 1)
	neighbors[b - 1].append(a - 1)

def search(source):
	ans = 0
	cur_max = 0
	cur_len = 0
	heap = [source]
	vis = [False for i in range(n)]
	while len(heap) > 0:
		x = heappop(heap)
		cur_max = max(cur_max, x)
		cur_len += 1
		vis[x] = True
		if cur_max - source + 1 == cur_len:
			ans += 1
		for y in neighbors[x]:
			if y >= source and vis[y] == False:
				heappush(heap, y)
	return ans
ans = 0
prev = 0
for x in range(n - 1, -1, -1):
	neigh = 0
	plus = 0
	for y in neighbors[x]:
		if y > x:
			neigh += 1
		if y == x + 1:
			plus = 1
	if plus == neigh and plus == 1:
		prev += 1
	else:
		prev = search(x)
	ans += prev
print(ans)


import math
import os
import random
import re
import sys
from heapq import *
n = int(input())
neighbors = {}
for x in range(n):
	neighbors[x] = []
for i in range(n - 1):
	(a, b) = map(int, input().split())
	neighbors[a - 1].append(b - 1)
	neighbors[b - 1].append(a - 1)

def search(source):
	ans = 0
	cur_max = 0
	cur_len = 0
	heap = [source]
	vis = [False for i in range(n)]
	while len(heap) > 0:
		x = heappop(heap)
		cur_max = max(cur_max, x)
		cur_len += 1
		vis[x] = True
		if cur_max - source + 1 == cur_len:
			ans += 1
		for y in neighbors[x]:
			if y >= source and vis[y] == False:
				heappush(heap, y)
	return ans
ans = 0
prev = 0
for x in range(n - 1, -1, -1):
	neigh = 0
	plus = 0
	for y in neighbors[x]:
		if y > x:
			neigh += 1
		if y == x + 1:
			plus = 1
	if plus == neigh and plus == 1:
		prev += 1
	else:
		prev = search(x)
	ans += prev
print(ans)


from heapq import *
n = int(input())
neighbors = {}
for x in range(n):
	neighbors[x] = []
for i in range(n - 1):
	(a, b) = map(int, input().split())
	neighbors[a - 1].append(b - 1)
	neighbors[b - 1].append(a - 1)

def search(source):
	ans = 0
	cur_max = 0
	cur_len = 0
	heap = [source]
	vis = [False for i in range(n)]
	while len(heap) > 0:
		x = heappop(heap)
		cur_max = max(cur_max, x)
		cur_len += 1
		vis[x] = True
		if cur_max - source + 1 == cur_len:
			ans += 1
		for y in neighbors[x]:
			if y >= source and vis[y] == False:
				heappush(heap, y)
	return ans
ans = 0
prev = 0
for x in range(n - 1, -1, -1):
	neigh = 0
	plus = 0
	for y in neighbors[x]:
		if y > x:
			neigh += 1
		if y == x + 1:
			plus = 1
	if plus == neigh and plus == 1:
		prev += 1
	else:
		prev = search(x)
	ans += prev
print(ans)


from heapq import *
n = int(input())
neighbors = {}
for x in range(n):
	neighbors[x] = []
for i in range(n - 1):
	(a, b) = map(int, input().split())
	neighbors[a - 1].append(b - 1)
	neighbors[b - 1].append(a - 1)

def search(source):
	ans = 0
	cur_max = 0
	cur_len = 0
	heap = [source]
	vis = [False for i in range(n)]
	while len(heap) > 0:
		x = heappop(heap)
		cur_max = max(cur_max, x)
		cur_len += 1
		vis[x] = True
		if cur_max - source + 1 == cur_len:
			ans += 1
		for y in neighbors[x]:
			if y >= source and vis[y] == False:
				heappush(heap, y)
	return ans
ans = 0
prev = 0
for x in range(n - 1, -1, -1):
	neigh = 0
	plus = 0
	for y in neighbors[x]:
		if y > x:
			neigh += 1
		if y == x + 1:
			plus = 1
	if plus == neigh and plus == 1:
		prev += 1
	else:
		prev = search(x)
	ans += prev
print(ans)


from heapq import *
n = int(input())
neighbors = {}
for x in range(n):
	neighbors[x] = []
for i in range(n - 1):
	(a, b) = map(int, input().split())
	neighbors[a - 1].append(b - 1)
	neighbors[b - 1].append(a - 1)

def search(source):
	ans = 0
	cur_max = 0
	cur_len = 0
	heap = [source]
	vis = [False for i in range(n)]
	while len(heap) > 0:
		x = heappop(heap)
		cur_max = max(cur_max, x)
		cur_len += 1
		vis[x] = True
		if cur_max - source + 1 == cur_len:
			ans += 1
		for y in neighbors[x]:
			if y >= source and vis[y] == False:
				heappush(heap, y)
	return ans
ans = 0
prev = 0
for x in range(n - 1, -1, -1):
	neigh = 0
	plus = 0
	for y in neighbors[x]:
		if y > x:
			neigh += 1
		if y == x + 1:
			plus = 1
	if plus == neigh and plus == 1:
		prev += 1
	else:
		prev = search(x)
	ans += prev
print(ans)


from heapq import *
n = int(input())
neighbors = {}
for x in range(n):
	neighbors[x] = []
for i in range(n - 1):
	(a, b) = map(int, input().split())
	neighbors[a - 1].append(b - 1)
	neighbors[b - 1].append(a - 1)

def search(source):
	ans = 0
	cur_max = 0
	cur_len = 0
	heap = [source]
	vis = [False for i in range(n)]
	while len(heap) > 0:
		x = heappop(heap)
		cur_max = max(cur_max, x)
		cur_len += 1
		vis[x] = True
		if cur_max - source + 1 == cur_len:
			ans += 1
		for y in neighbors[x]:
			if y >= source and vis[y] == False:
				heappush(heap, y)
	return ans
ans = 0
prev = 0
for x in range(n - 1, -1, -1):
	neigh = 0
	plus = 0
	for y in neighbors[x]:
		if y > x:
			neigh += 1
		if y == x + 1:
			plus = 1
	if plus == neigh and plus == 1:
		prev += 1
	else:
		prev = search(x)
	ans += prev
print(ans)


from heapq import *
n = int(input())
neighbors = {}
for x in range(n):
	neighbors[x] = []
for i in range(n - 1):
	(a, b) = map(int, input().split())
	neighbors[a - 1].append(b - 1)
	neighbors[b - 1].append(a - 1)

def search(source):
	ans = 0
	cur_max = 0
	cur_len = 0
	heap = [source]
	vis = [False for i in range(n)]
	while len(heap) > 0:
		x = heappop(heap)
		cur_max = max(cur_max, x)
		cur_len += 1
		vis[x] = True
		if cur_max - source + 1 == cur_len:
			ans += 1
		for y in neighbors[x]:
			if y >= source and vis[y] == False:
				heappush(heap, y)
	return ans
ans = 0
prev = 0
for x in range(n - 1, -1, -1):
	neigh = 0
	plus = 0
	for y in neighbors[x]:
		if y > x:
			neigh += 1
		if y == x + 1:
			plus = 1
	if plus == neigh and plus == 1:
		prev += 1
	else:
		prev = search(x)
	ans += prev
print(ans)


from heapq import *
n = int(input())
neighbors = {}
for x in range(n):
	neighbors[x] = []
for i in range(n - 1):
	(a, b) = map(int, input().split())
	neighbors[a - 1].append(b - 1)
	neighbors[b - 1].append(a - 1)

def search(source):
	ans = 0
	cur_max = 0
	cur_len = 0
	heap = [source]
	vis = [False for i in range(n)]
	while len(heap) > 0:
		x = heappop(heap)
		cur_max = max(cur_max, x)
		cur_len += 1
		vis[x] = True
		if cur_max - source + 1 == cur_len:
			ans += 1
		for y in neighbors[x]:
			if y >= source and vis[y] == False:
				heappush(heap, y)
	return ans
ans = 0
prev = 0
for x in range(n - 1, -1, -1):
	neigh = 0
	plus = 0
	for y in neighbors[x]:
		if y > x:
			neigh += 1
		if y == x + 1:
			plus = 1
	if plus == neigh and plus == 1:
		prev += 1
	else:
		prev = search(x)
	ans += prev
print(ans)


from heapq import *
n = int(input())
neighbors = {}
for x in range(n):
	neighbors[x] = []
for i in range(n - 1):
	(a, b) = map(int, input().split())
	neighbors[a - 1].append(b - 1)
	neighbors[b - 1].append(a - 1)

def search(source):
	ans = 0
	cur_max = 0
	cur_len = 0
	heap = [source]
	vis = [False for i in range(n)]
	while len(heap) > 0:
		x = heappop(heap)
		cur_max = max(cur_max, x)
		cur_len += 1
		vis[x] = True
		if cur_max - source + 1 == cur_len:
			ans += 1
		for y in neighbors[x]:
			if y >= source and vis[y] == False:
				heappush(heap, y)
	return ans
ans = 0
prev = 0
for x in range(n - 1, -1, -1):
	neigh = 0
	plus = 0
	for y in neighbors[x]:
		if y > x:
			neigh += 1
		if y == x + 1:
			plus = 1
	if plus == neigh and plus == 1:
		prev += 1
	else:
		prev = search(x)
	ans += prev
print(ans)


from heapq import *
n = int(input())
neighbors = {}
for x in range(n):
	neighbors[x] = []
for i in range(n - 1):
	(a, b) = map(int, input().split())
	neighbors[a - 1].append(b - 1)
	neighbors[b - 1].append(a - 1)

def search(source):
	ans = 0
	cur_max = 0
	cur_len = 0
	heap = [source]
	vis = [False for i in range(n)]
	while len(heap) > 0:
		x = heappop(heap)
		cur_max = max(cur_max, x)
		cur_len += 1
		vis[x] = True
		if cur_max - source + 1 == cur_len:
			ans += 1
		for y in neighbors[x]:
			if y >= source and vis[y] == False:
				heappush(heap, y)
	return ans
ans = 0
prev = 0
for x in range(n - 1, -1, -1):
	neigh = 0
	plus = 0
	for y in neighbors[x]:
		if y > x:
			neigh += 1
		if y == x + 1:
			plus = 1
	if plus == neigh and plus == 1:
		prev += 1
	else:
		prev = search(x)
	ans += prev
print(ans)


from heapq import *
n = int(input())
neighbors = {}
for x in range(n):
	neighbors[x] = []
for i in range(n - 1):
	(a, b) = map(int, input().split())
	neighbors[a - 1].append(b - 1)
	neighbors[b - 1].append(a - 1)

def search(source):
	ans = 0
	cur_max = 0
	cur_len = 0
	heap = [source]
	vis = [False for i in range(n)]
	while len(heap) > 0:
		x = heappop(heap)
		cur_max = max(cur_max, x)
		cur_len += 1
		vis[x] = True
		if cur_max - source + 1 == cur_len:
			ans += 1
		for y in neighbors[x]:
			if y >= source and vis[y] == False:
				heappush(heap, y)
	return ans
ans = 0
prev = 0
for x in range(n - 1, -1, -1):
	neigh = 0
	plus = 0
	for y in neighbors[x]:
		if y > x:
			neigh += 1
		if y == x + 1:
			plus = 1
	if plus == neigh and plus == 1:
		prev += 1
	else:
		prev = search(x)
	ans += prev
print(ans)


from heapq import *
n = int(input())
neighbors = {}
for x in range(n):
	neighbors[x] = []
for i in range(n - 1):
	(a, b) = map(int, input().split())
	neighbors[a - 1].append(b - 1)
	neighbors[b - 1].append(a - 1)

def search(source):
	ans = 0
	cur_max = 0
	cur_len = 0
	heap = [source]
	vis = [False for i in range(n)]
	while len(heap) > 0:
		x = heappop(heap)
		cur_max = max(cur_max, x)
		cur_len += 1
		vis[x] = True
		if cur_max - source + 1 == cur_len:
			ans += 1
		for y in neighbors[x]:
			if y >= source and vis[y] == False:
				heappush(heap, y)
	return ans
ans = 0
prev = 0
for x in range(n - 1, -1, -1):
	neigh = 0
	plus = 0
	for y in neighbors[x]:
		if y > x:
			neigh += 1
		if y == x + 1:
			plus = 1
	if plus == neigh and plus == 1:
		prev += 1
	else:
		prev = search(x)
	ans += prev
print(ans)