code: 
  from __future__ import annotations
  
  from collections import Counter
  
  
  
  def 		UpperCamelCase    (					_UpperCAmelCase     :      List[Any]     )      -> list[int]:
  
  
  
  
  
  
  						'''simple docstring'''
  
  						_lowercase					:  Dict    			=      [True] * n
  						_lowercase					:  Tuple    			=      False
  						_lowercase					:  Optional[int]    			=      False
  						_lowercase					:  Any    			=      True
  
  						for i in range(3   , int(n**0.5 + 1     )   , 2     ):
  												_lowercase					:  Dict    			=      i * 2
  												while index < n:
  																		_lowercase					:  List[Any]    			=      False
  																		_lowercase					:  Optional[int]    			=      index + i
  
  						_lowercase					:  List[str]    			=      [2]
  
  						for i in range(3   , snake_case_   , 2     ):
  												if is_prime[i]:
  																		primes.append(snake_case_     )
  
  						return primes
  
  
  
  def 		UpperCamelCase    (					_UpperCAmelCase     :      Any     )      -> list[list[int]]:
  
  
  
  
  
  
  						'''simple docstring'''
  
  						_lowercase					:  Any    			=      str(snake_case_     )
  						_lowercase					:  List[str]    			=      []
  						_lowercase					:  List[str]    			=      ['''0''', '''1''', '''2''', '''3''', '''4''', '''5''', '''6''', '''7''', '''8''', '''9''']
  
  						for duplicate in Counter(snake_case_     ) - Counter(set(snake_case_     )     ):
  												_lowercase					:  Any    			=      [int(number_str.replace(snake_case_   , snake_case_     )     ) for digit in digits]
  												replacements.append(snake_case_     )
  
  						return replacements
  
  
  
  def 		UpperCamelCase    (					_UpperCAmelCase     :      Dict = 8     )      -> int:
  
  
  
  
  
  
  						'''simple docstring'''
  
  						_lowercase					:  Optional[Any]    			=      set()
  
  						# Filter primes with less than 3 replaceable digits
  						_lowercase					:  str    			=      {
  						    x for x in set(prime_sieve(100_0000     )     ) if len(str(snake_case_     )     ) - len(set(str(snake_case_     )     )     ) >= 3
  						}
  
  						for prime in primes:
  												if prime in numbers_checked:
  																		continue
  
  												_lowercase					:  Dict    			=      digit_replacements(snake_case_     )
  
  												for family in replacements:
  																		numbers_checked.update(snake_case_     )
  																		_lowercase					:  List[str]    			=      primes.intersection(snake_case_     )
  
  																		if len(snake_case_     ) != family_length:
  																								continue
  
  																		return min(snake_case_     )
  
  						return -1
  
  
  if __name__ == "__main__":
  							print(solution())
  
  
  
  
  
style_context: 
  from dataclasses import dataclass
  
  UpperCamelCase_	:    List[str]  					=       """0.1"""
  UpperCamelCase_	:    Optional[Any]  					=       """Lucia Harcekova"""
  
  
  
  
  @dataclass
  class      __lowercase	:
  	_A   			=      42
  	_A   			=      42
  	_A   			=      42
  
  
  
  
  
  
  	def __repr__(self							:   List[str]						)   -> str:
  							return F"""({self.offset}, {self.length}, {self.indicator})"""
  
  
  
  
  class      __lowercase	:
  
  
  
  
  
  
  	def __init__(self							:   Union[str, Any]			,  snake_case							:   int = 13			,  snake_case							:   int = 6						)   -> None:
  							_lowercase					:  int    			=      window_size
  							_lowercase					:  List[Any]    			=      lookahead_buffer_size
  							_lowercase					:  str    			=      self.window_size - self.lookahead_buffer_size
  
  
  
  
  
  
  	def 			_a(self							:   List[str]			,  snake_case							:   str						)   -> list[Token]:
  							_lowercase					:  List[Any]    			=      []
  							_lowercase					:  str    			=      ""
  
  							# while there are still characters in text to compress
  							while text:
  													# find the next encoding phrase
  													# - triplet with offset, length, indicator (the next encoding character)
  													_lowercase					:  Union[str, Any]    			=      self._find_encoding_token(snake_case			,  snake_case						)
  
  													# update the search buffer:
  													# - add new characters from text into it
  													# - check if size exceed the max search buffer size, if so, drop the
  													#   oldest elements
  													search_buffer += text[: token.length + 1]
  													if len(snake_case						) > self.search_buffer_size:
  																			_lowercase					:  Optional[int]    			=      search_buffer[-self.search_buffer_size :]
  
  													# update the text
  													_lowercase					:  str    			=      text[token.length + 1 :]
  
  													# append the token to output
  													output.append(snake_case						)
  
  							return output
  
  
  
  
  
  
  	def 			_a(self							:   Optional[Any]			,  snake_case							:   list[Token]						)   -> str:
  							_lowercase					:  Optional[int]    			=      ""
  
  							for token in tokens:
  													for _ in range(token.length						):
  																			output += output[-token.offset]
  													output += token.indicator
  
  							return output
  
  
  
  
  
  
  	def 			_a(self							:   Dict			,  snake_case							:   str			,  snake_case							:   str						)   -> Token:
  
  							if not text:
  													raise ValueError("We need some text to work with."						)
  
  							# Initialise result parameters to default values
  							_lowercase			,						_lowercase					:  Tuple    			=      0, 0
  
  							if not search_buffer:
  													return Token(snake_case			,  snake_case			,  text[length]						)
  
  							for i, character in enumerate(snake_case						):
  													_lowercase					:  Tuple    			=      len(snake_case						) - i
  													if character == text[0]:
  																			_lowercase					:  List[str]    			=      self._match_length_from_index(snake_case			,  snake_case			,  0			,  snake_case						)
  																			# if the found length is bigger than the current or if it's equal,
  																			# which means it's offset is smaller: update offset and length
  																			if found_length >= length:
  																									_lowercase			,						_lowercase					:  Optional[Any]    			=      found_offset, found_length
  
  							return Token(snake_case			,  snake_case			,  text[length]						)
  
  
  
  
  
  
  	def 			_a(self							:   Union[str, Any]			,  snake_case							:   str			,  snake_case							:   str			,  snake_case							:   int			,  snake_case							:   int						)   -> int:
  							if not text or text[text_index] != window[window_index]:
  													return 0
  							return 1 + self._match_length_from_index(
  							    snake_case			,  window + text[text_index]			,  text_index + 1			,  window_index + 1						)
  
  
  if __name__ == "__main__":
  							from doctest import testmod
  
  							testmod()
  							# Initialize compressor class
  							UpperCamelCase_	:    Optional[int]  					=       LZaaCompressor(window_size=13, lookahead_buffer_size=6)
  
  							# Example
  							UpperCamelCase_	:    Optional[int]  					=       """cabracadabrarrarrad"""
  							UpperCamelCase_	:    Tuple  					=       lzaa_compressor.compress(TEXT)
  							print(lzaa_compressor.compress("""ababcbababaa"""))
  							UpperCamelCase_	:    Union[str, Any]  					=       lzaa_compressor.decompress(compressed_text)
  							assert decompressed_text == TEXT, "The LZ77 algorithm returned the invalid result."
  
  
  
  
  