





def _A       (   __magic_name__	):
   return [
       txt[:a] + txt[a].upper() + txt[a + 1 :]
       for a in range(len(__magic_name__	)	)
       if txt[a].isalpha()
   ]


if __name__ == "__main__":
  __import__("""doctest""").testmod()











import math


def _A       (   __magic_name__	):
   lowercase__			       =  math.loga(math.sqrt(4 * positive_integer + 1	) / 2 + 1 / 2	)

   return exponent == int(__magic_name__	)


def _A       (   __magic_name__ = 1 / 1_2345	):
   lowercase__			       =  0
   lowercase__			       =  0

   lowercase__			       =  3
   while True:
      lowercase__			       =  (integer**2 - 1) / 4
      # if candidate is an integer, then there is a partition for k
      if partition_candidate == int(__magic_name__	):
         lowercase__			       =  int(__magic_name__	)
         total_partitions += 1
         if check_partition_perfect(__magic_name__	):
            perfect_partitions += 1
      if perfect_partitions > 0:
         if perfect_partitions / total_partitions < max_proportion:
            return int(__magic_name__	)
      integer += 1


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






