





def   __lowerCamelCase   (				__a  :int       ,	__a  :int       ,	__a  :int       )						->							int:






		"""simple docstring"""

		if exponent == 1:
				return base
		if exponent % 2 == 0:
				A__     =  _modexpt(__a       ,	exponent // 2       ,	__a       ) % modulo_value
				return (x * x) % modulo_value
		else:
				return (base * _modexpt(__a       ,	exponent - 1       ,	__a       )) % modulo_value







def   __lowerCamelCase   (				__a  :int = 1_7_7_7       ,	__a  :int = 1_8_5_5       ,	__a  :int = 8       )						->							int:






		"""simple docstring"""

		A__     =  base
		for _ in range(1       ,	__a       ):
				A__     =  _modexpt(__a       ,	__a       ,	1_0**digits       )

		return result


if __name__ == "__main__":
					print(F'''{solution() = }''')










def   __lowerCamelCase   (				__a  :str       )						->							bool:






		"""simple docstring"""

		A__     =  0
		for ch in input_str:
				A__     =  ord(__a       )
				A__     =  pow(2       ,	__a       )

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



