

import os
from math import logaa



def 			_A	(      SCREAMING_SNAKE_CASE = "base_exp.txt"      ):
	UpperCAmelCase__:	float									= 0
	UpperCAmelCase__:	Optional[Any]									= 0
	for i, line in enumerate(open(os.path.join(os.path.dirname(SCREAMING_SNAKE_CASE      )	,SCREAMING_SNAKE_CASE      )      )      ):
		UpperCAmelCase__							,						UpperCAmelCase__:	Tuple									= list(map(SCREAMING_SNAKE_CASE	,line.split(","      )      )      )
		if x * logaa(SCREAMING_SNAKE_CASE      ) > largest:
			UpperCAmelCase__:	List[Any]									= x * logaa(SCREAMING_SNAKE_CASE      )
			UpperCAmelCase__:	Optional[Any]									= i + 1
	return result


if __name__ == "__main__":
					print(solution())


from __future__ import annotations

from typing import Any

class __UpperCamelCase     :






					'''simple docstring'''



					def __init__(				self				,      lowerCamelCase__						):
						UpperCAmelCase__:	Optional[int]									= num_of_nodes
						UpperCAmelCase__:	list[list[int]]									= []
						UpperCAmelCase__:	dict[int, int]									= {}





					def    _UpperCAmelCase    (				self				,      lowerCamelCase__				,      lowerCamelCase__				,      lowerCamelCase__						):
						self.m_edges.append([u_node, v_node, weight]						)





					def    _UpperCAmelCase    (				self				,      lowerCamelCase__						):

						if self.m_component[u_node] == u_node:
							return u_node
						return self.find_component(self.m_component[u_node]						)





					def    _UpperCAmelCase    (				self				,      lowerCamelCase__						):

						if self.m_component[u_node] != u_node:
							for k in self.m_component:
								UpperCAmelCase__:	Optional[Any]									= self.find_component(lowerCamelCase__						)





					def    _UpperCAmelCase    (				self				,      lowerCamelCase__				,      lowerCamelCase__				,      lowerCamelCase__						):

						if component_size[u_node] <= component_size[v_node]:
							UpperCAmelCase__:	Tuple									= v_node
							component_size[v_node] += component_size[u_node]
							self.set_component(lowerCamelCase__						)

						elif component_size[u_node] >= component_size[v_node]:
							UpperCAmelCase__:	Dict									= self.find_component(lowerCamelCase__						)
							component_size[u_node] += component_size[v_node]
							self.set_component(lowerCamelCase__						)





					def    _UpperCAmelCase    (				self						):
						UpperCAmelCase__:	Dict									= []
						UpperCAmelCase__:	int									= 0

						UpperCAmelCase__:	list[Any]									= [-1] * self.m_num_of_nodes

						# A list of components (initialized to all of the nodes)
						for node in range(self.m_num_of_nodes						):
							self.m_component.update({node: node}						)
							component_size.append(1						)

						UpperCAmelCase__:	Union[str, Any]									= self.m_num_of_nodes

						while num_of_components > 1:
							for edge in self.m_edges:
								UpperCAmelCase__							,						UpperCAmelCase__							,						UpperCAmelCase__:	str									= edge

								UpperCAmelCase__:	str									= self.m_component[u]
								UpperCAmelCase__:	Optional[Any]									= self.m_component[v]

								if u_component != v_component:

									for component in (u_component, v_component):
										if (
										    minimum_weight_edge[component] == -1
										    or minimum_weight_edge[component][2] > w
										):
											UpperCAmelCase__:	List[Any]									= [u, v, w]

							for edge in minimum_weight_edge:
								if isinstance(lowerCamelCase__				,      lowerCamelCase__						):
									UpperCAmelCase__							,						UpperCAmelCase__							,						UpperCAmelCase__:	str									= edge

									UpperCAmelCase__:	str									= self.m_component[u]
									UpperCAmelCase__:	int									= self.m_component[v]

									if u_component != v_component:
										mst_weight += w
										self.union(lowerCamelCase__				,      lowerCamelCase__				,      lowerCamelCase__						)
										print(F"Added edge [{u} - {v}]\nAdded weight: {w}\n"						)
										num_of_components -= 1

							UpperCAmelCase__:	Any									= [-1] * self.m_num_of_nodes
						print(F"The total weight of the minimal spanning tree is: {mst_weight}"						)



def 			_A	(      ):
	pass


if __name__ == "__main__":
					import doctest

					doctest.testmod()