
"""simple docstring"""






from collections import deque

from .hash_table import HashTable




class 			_SCREAMING_SNAKE_CASE					(			A__							):






			def __init__(					self       ,   *__A       ,   **__A       )			->     List[str]:
						super().__init__(*__A       ,   **__A       )






			def  __lowerCAmelCase (					self       ,   __A       ,   __A       )			->     Optional[Any]:
						lowerCAmelCase_    :List[str]			     =  deque([]       ) if self.values[key] is None else self.values[key]
						self.values[key].appendleft(__A       )
						lowerCAmelCase_    :List[str]			     =  self.values[key]






			def  __lowerCAmelCase (					self       )			->     Optional[Any]:
						return (
						    sum(self.charge_factor - len(__A       ) for slot in self.values       )
						    / self.size_table
						    * self.charge_factor
						)






			def  __lowerCAmelCase (					self       ,   __A       ,   __A=None       )			->     List[str]:
						if not (
						    len(self.values[key]       ) == self.charge_factor and self.values.count(__A       ) == 0
						):
									return key
						return super()._collision_resolution(__A       ,   __A       )












import os
from math import logaa



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


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



