

"""simple docstring"""




def       lowercase__						(       snake_case_   :List[str]=28_123    ):
	__UpperCAmelCase      		= [1] * (limit + 1)

	for i in range(2			,		int(limit**0.5    ) + 1    ):
		sum_divs[i * i] += i
		for k in range(i + 1			,		limit // i + 1    ):
			sum_divs[k * i] += k + i

	__UpperCAmelCase      		= set()
	__UpperCAmelCase      		= 0

	for n in range(1			,		limit + 1    ):
		if sum_divs[n] > n:
			abundants.add(snake_case_    )

		if not any((n - a in abundants) for a in abundants    ):
			res += n

	return res


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

'''simple docstring'''






def  _SCREAMING_SNAKE_CASE		(      __snake_case							:			str   ,		__snake_case							:			str   ,		__snake_case							:			List[Any]=False				):

     if isinstance(__snake_case   ,		__snake_case				) and isinstance(__snake_case   ,		__snake_case				):
          _A    		=  len(set_a.intersection(__snake_case				)				)

          if alternative_union:
               _A    		=  len(__snake_case				) + len(__snake_case				)
          else:
               _A    		=  len(set_a.union(__snake_case				)				)

          return intersection / union

     if isinstance(__snake_case   ,		(list, tuple)				) and isinstance(__snake_case   ,		(list, tuple)				):
          _A    		=  [element for element in set_a if element in set_b]

          if alternative_union:
               _A    		=  len(__snake_case				) + len(__snake_case				)
               return len(__snake_case				) / union
          else:
               _A    		=  set_a + [element for element in set_b if element not in set_a]
               return len(__snake_case				) / len(__snake_case				)

          return len(__snake_case				) / len(__snake_case				)
     return None


if __name__ == "__main__":
   _UpperCAmelCase    :     Optional[Any]         =       {'''a''', '''b''', '''c''', '''d''', '''e'''}
   _UpperCAmelCase    :     str         =       {'''c''', '''d''', '''e''', '''f''', '''h''', '''i'''}
   print(jaccard_similarity(set_a, set_b))



