






'''simple docstring'''



def      _a     (						_lowercase :     int = 200  ):





     '''simple docstring'''






     __UpperCAmelCase     :			Dict  							=      [1, 2, 5, 10, 20, 50, 100, 200]
     __UpperCAmelCase     :			Optional[Any]  							=      [0] * (pence + 1)
     __UpperCAmelCase     :			Optional[int]  							=      1  # base case: 1 way to make 0 pence

     for coin in coins:
          for i in range(lowerCamelCase_      , pence + 1      , 1  ):
               number_of_ways[i] += number_of_ways[i - coin]
     return number_of_ways[pence]


if __name__ == "__main__":
      assert solution(2_0_0) == 7_3_6_8_2



'''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())