


'''simple docstring'''



from __future__ import annotations




def      _a     (						_lowercase :     list[int]  ):  # This function is recursive





     '''simple docstring'''






     __UpperCAmelCase     :			List[str]  							=      len(_lowercase  )
     # If the array contains only one element, we return it (it's the stop condition of
     # recursion)
     if array_length <= 1:
          return array
          # Else
     __UpperCAmelCase     :			Optional[int]  							=      array[0]
     __UpperCAmelCase     :			Union[str, Any]  							=      False
     __UpperCAmelCase     :			Dict  							=      1
     __UpperCAmelCase     :			list[int]  							=      []
     while not is_found and i < array_length:
          if array[i] < pivot:
               __UpperCAmelCase     :			Optional[int]  							=      True
               __UpperCAmelCase     :			List[Any]  							=      [element for element in array[i:] if element >= array[i]]
               __UpperCAmelCase     :			Optional[Any]  							=      longest_subsequence(_lowercase  )
               if len(_lowercase  ) > len(_lowercase  ):
                    __UpperCAmelCase     :			int  							=      temp_array
          else:
               i += 1

     __UpperCAmelCase     :			List[str]  							=      [element for element in array[1:] if element >= pivot]
     __UpperCAmelCase     :			Any  							=      [pivot, *longest_subsequence(_lowercase  )]
     if len(_lowercase  ) > len(_lowercase  ):
          return temp_array
     else:
          return longest_subseq


if __name__ == "__main__":
      import doctest

      doctest.testmod()



'''simple docstring'''



def      _a     (						_lowercase :     List[str]  ):





     '''simple docstring'''






     __UpperCAmelCase     :			str  							=      1
     __UpperCAmelCase     :			List[str]  							=      2
     while i * i <= n:
          __UpperCAmelCase     :			Optional[Any]  							=      0
          while n % i == 0:
               n //= i
               multiplicity += 1
          n_divisors *= multiplicity + 1
          i += 1
     if n > 1:
          n_divisors *= 2
     return n_divisors




def      _a     (						):





     '''simple docstring'''






     __UpperCAmelCase     :			Optional[Any]  							=      1
     __UpperCAmelCase     :			List[Any]  							=      1

     while True:
          i += 1
          t_num += i

          if count_divisors(_lowercase  ) > 500:
               break

     return t_num


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