def minPathLen(n, B):#     node_list = [0]*100000#     for i in range(len(B)):         b = B[i]         x = b[0]         y = b[1]         node_list[y] = node_list[x] + 1     #print(node_list)     depth = 0     for i in range(1,n+1):         if node_list[i] > depth:             depth = node_list[i]         else:             depth = depth     minPath_length = 2*n-2-depth     return minPath_length if __name__ == '__main__':     n = int(raw_input())     B=[]     for i in range(n-1):         A = [i for i in raw_input().split()]         A = map(int, A)         B.append(A)     #print(n,B)     result = minPathLen(n, B)     print(result)