



'''simple docstring'''






from typing import Any
def 				lowerCamelCase__	(						_A    ):
  if not input_list:
    return []
  a						: Dict					       =					[input_list.count(_A    ) for value in input_list]
  a						: Union[str, Any]					       =					max(_A    )  # Gets the maximum count in the input list.
  # Gets values of modes
  return sorted({input_list[i] for i, value in enumerate(_A    ) if value == y}    )


if __name__ == "__main__":
     import doctest

     doctest.testmod()




'''simple docstring'''






from math import factorial, pi
def 				lowerCamelCase__	(						_A			,      _A = 30    ):

  if not isinstance(_A			,      (int, float)    ):
    raise ValueError('maclaurin_sin() requires either an int or float for theta'    )

  if not isinstance(_A			,      _A    ) or accuracy <= 0:
    raise ValueError('maclaurin_sin() requires a positive int for accuracy'    )

  a						: Dict					       =					float(_A    )
  a						: List[Any]					       =					theta // (2 * pi)
  theta -= 2 * div * pi
  return sum(
      (-1) ** r * theta ** (2 * r + 1) / factorial(2 * r + 1    ) for r in range(_A    )    )
def 				lowerCamelCase__	(						_A			,      _A = 30    ):

  if not isinstance(_A			,      (int, float)    ):
    raise ValueError('maclaurin_cos() requires either an int or float for theta'    )

  if not isinstance(_A			,      _A    ) or accuracy <= 0:
    raise ValueError('maclaurin_cos() requires a positive int for accuracy'    )

  a						: int					       =					float(_A    )
  a						: str					       =					theta // (2 * pi)
  theta -= 2 * div * pi
  return sum((-1) ** r * theta ** (2 * r) / factorial(2 * r    ) for r in range(_A    )    )


if __name__ == "__main__":
     import doctest

     doctest.testmod()

     print(maclaurin_sin(1_0))
     print(maclaurin_sin(-1_0))
     print(maclaurin_sin(1_0, 1_5))
     print(maclaurin_sin(-1_0, 1_5))

     print(maclaurin_cos(5))
     print(maclaurin_cos(-5))
     print(maclaurin_cos(1_0, 1_5))
     print(maclaurin_cos(-1_0, 1_5))