




def 				_A  (		lowerCAmelCase_	:   str     ):
     """simple docstring"""

     lowerCAmelCase__            =					0
     for ch in input_str:
          lowerCAmelCase__            =					ord(lowerCAmelCase_     )
          lowerCAmelCase__            =					pow(2  ,							lowerCAmelCase_     )

          # If we already turned on bit for current character's unicode
          if bitmap >> ch_unicode & 1 == 1:
               return False
          bitmap |= ch_bit_index_on
     return True


if __name__ == "__main__":
     import doctest

     doctest.testmod()








"""simple docstring"""
def       __UpperCamelCase						(		snake_case__ = 200       ):
	A_		:    Union[str, Any]						     = [1, 2, 5, 10, 20, 50, 100, 200]
	A_		:    int						     = [0] * (pence + 1)
	A_		:    Tuple						     = 1  # base case: 1 way to make 0 pence

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


if __name__ == "__main__":
							assert solution(200) == 73_682

