
from __future__ import annotations

from collections import Counter


def     a__			(    snake_case    ):





  """simple docstring"""
  __SCREAMING_SNAKE_CASE     :					int			=						[True] * n
  __SCREAMING_SNAKE_CASE     :					Optional[int]			=						False
  __SCREAMING_SNAKE_CASE     :					Union[str, Any]			=						False
  __SCREAMING_SNAKE_CASE     :					Tuple			=						True

  for i in range(3   ,	int(n**0.5 + 1    )   ,	2    ):
    __SCREAMING_SNAKE_CASE     :					str			=						i * 2
    while index < n:
      __SCREAMING_SNAKE_CASE     :					Tuple			=						False
      __SCREAMING_SNAKE_CASE     :					Optional[int]			=						index + i

  __SCREAMING_SNAKE_CASE     :					int			=						[2]

  for i in range(3   ,	lowerCamelCase_   ,	2    ):
    if is_prime[i]:
      primes.append(lowerCamelCase_    )

  return primes


def     a__			(    snake_case    ):





  """simple docstring"""
  __SCREAMING_SNAKE_CASE     :					List[str]			=						str(lowerCamelCase_    )
  __SCREAMING_SNAKE_CASE     :					Optional[Any]			=						[]
  __SCREAMING_SNAKE_CASE     :					str			=						['''0''', '''1''', '''2''', '''3''', '''4''', '''5''', '''6''', '''7''', '''8''', '''9''']

  for duplicate in Counter(lowerCamelCase_    ) - Counter(set(lowerCamelCase_    )    ):
    __SCREAMING_SNAKE_CASE     :					int			=						[int(number_str.replace(lowerCamelCase_   ,	lowerCamelCase_    )    ) for digit in digits]
    replacements.append(lowerCamelCase_    )

  return replacements


def     a__			(    snake_case = 8    ):





  """simple docstring"""
  __SCREAMING_SNAKE_CASE     :					Optional[Any]			=						set()

  # Filter primes with less than 3 replaceable digits
  __SCREAMING_SNAKE_CASE     :					Tuple			=						{
      x for x in set(prime_sieve(1_000_000    )    ) if len(str(lowerCamelCase_    )    ) - len(set(str(lowerCamelCase_    )    )    ) >= 3
  }

  for prime in primes:
    if prime in numbers_checked:
      continue

    __SCREAMING_SNAKE_CASE     :					List[str]			=						digit_replacements(lowerCamelCase_    )

    for family in replacements:
      numbers_checked.update(lowerCamelCase_    )
      __SCREAMING_SNAKE_CASE     :					str			=						primes.intersection(lowerCamelCase_    )

      if len(lowerCamelCase_    ) != family_length:
        continue

      return min(lowerCamelCase_    )

  return -1


if __name__ == "__main__":
  print(solution())


from collections import defaultdict


def     a__			(    snake_case    ):





  """simple docstring"""
  __SCREAMING_SNAKE_CASE     :					defaultdict[str, int]			=						defaultdict(snake_case    )
  # Creating a dictionary containing count of each word
  for word in sentence.split():
    occurrence[word] += 1
  return occurrence


if __name__ == "__main__":
   for word, count in word_occurrence("""INPUT STRING""").items():
      print(f'''{word}: {count}''')
