





'''simple docstring'''


from collections import defaultdict


def 						__a(SCREAMING_SNAKE_CASE_	:       str		,							SCREAMING_SNAKE_CASE_	:       str     ):



    '''simple docstring'''





    _lowerCAmelCase						      =   first_str.lower().strip()
    _lowerCAmelCase						      =   second_str.lower().strip()

    # Remove whitespace
    _lowerCAmelCase						      =   first_str.replace(" "		,							""     )
    _lowerCAmelCase						      =   second_str.replace(" "		,							""     )

    # Strings of different lengths are not anagrams
    if len(SCREAMING_SNAKE_CASE_     ) != len(SCREAMING_SNAKE_CASE_     ):
        return False

    # Default values for count should be 0
    _lowerCAmelCase						      =   defaultdict(SCREAMING_SNAKE_CASE_     )

    # For each character in input strings,
    # increment count in the corresponding
    for i in range(len(SCREAMING_SNAKE_CASE_     )     ):
        count[first_str[i]] += 1
        count[second_str[i]] -= 1

    return all(_count == 0 for _count in count.values()     )


if __name__ == "__main__":
       from doctest import testmod

       testmod()
       _SCREAMING_SNAKE_CASE									=				input("Enter the first string ").strip()
       _SCREAMING_SNAKE_CASE									=				input("Enter the second string ").strip()

       _SCREAMING_SNAKE_CASE									=				check_anagrams(input_a, input_b)
       print(f'''{input_a} and {input_b} are {'' if status else 'not '}anagrams.''')






from __future__ import annotations

import numpy as np
def 							UpperCamelCase_(					_A :list[float]	)->		Optional[Any]:
			return np.maximum(0					,  _A	)


if __name__ == "__main__":
						print(np.array(relu([-1, 0, 5])))  # --> [0, 0, 5]


