






# Lint as: python3
import dataclasses
import re
from dataclasses import dataclass
from functools import total_ordering
from typing import Optional, Union


snake_case__   :						List[str]													=   re.compile(R"""^(?P<major>\d+)""" R"""\.(?P<minor>\d+)""" R"""\.(?P<patch>\d+)$""")


@total_ordering
@dataclass
class     _a							:






  """simple docstring"""





  A_						       = 42
  A_						       = None
  A_						       = None
  A_						       = None
  A_						       = None




  def  _UpperCAmelCase  (  self			)      ->			List[str]:
     UpperCamelCase_		,   UpperCamelCase_		,   UpperCamelCase_						=  _str_to_version_tuple(self.version_str			)




  def __repr__(  self			)      ->			Union[str, Any]:
     return f"""{self.tuple[0]}.{self.tuple[1]}.{self.tuple[2]}"""




  @property
  def  _UpperCAmelCase  (  self			)      ->			int:
     return self.major, self.minor, self.patch




  def  _UpperCAmelCase  (  self		,		_UpperCAmelCase			)      ->			str:
     if isinstance(_UpperCAmelCase		,		_UpperCAmelCase			):
        return Version(_UpperCAmelCase			)
     elif isinstance(_UpperCAmelCase		,		_UpperCAmelCase			):
        return other
     raise TypeError(f"""{other} (type {type(_UpperCAmelCase			)}) cannot be compared to version."""			)




  def __eq__(  self		,		_UpperCAmelCase			)      ->			List[Any]:
     try:
        UpperCamelCase_						=  self._validate_operand(_UpperCAmelCase			)
     except (TypeError, ValueError):
        return False
     else:
        return self.tuple == other.tuple




  def __lt__(  self		,		_UpperCAmelCase			)      ->			Optional[int]:
     UpperCamelCase_						=  self._validate_operand(_UpperCAmelCase			)
     return self.tuple < other.tuple




  def __hash__(  self			)      ->			Dict:
     return hash(_version_tuple_to_str(self.tuple			)			)




  @classmethod
  def  _UpperCAmelCase  (  cls		,		_UpperCAmelCase			)      ->			Tuple:
     UpperCamelCase_						=  {f.name for f in dataclasses.fields(cls			)}
     return cls(**{k: v for k, v in dic.items() if k in field_names}			)




  def  _UpperCAmelCase  (  self			)      ->			str:
     return self.version_str






def      _snake_case     (__lowercase):
   UpperCamelCase_						=  _VERSION_REG.match(__lowercase)
   if not res:
      raise ValueError(f"""Invalid version '{version_str}'. Format should be x.y.z with {{x,y,z}} being digits.""")
   return tuple(int(__lowercase) for v in [res.group('major'), res.group('minor'), res.group('patch')])






def      _snake_case     (__lowercase):
   return ".".join(str(__lowercase) for v in version_tuple)






from __future__ import annotations




def    lowerCAmelCase_  (		lowercase:				str	,       lowercase:				list[str] | None = None	,       lowercase:				dict[str, float] | None = None	,       lowercase:				bool = False	,       )     ->					tuple[int, float, str]:







 '''simple docstring'''
 _UpperCamelCase:  Any    						=			cipher_alphabet or [chr(lowercase		) for i in range(97	,       123		)]

 # If the argument is None or the user provided an empty dictionary
 if not frequencies_dict:
  # Frequencies of letters in the english language (how much they show up)
  _UpperCamelCase:  Any    						=			{
      '''a''': 0.08497,
      '''b''': 0.01492,
      '''c''': 0.02202,
      '''d''': 0.04253,
      '''e''': 0.11162,
      '''f''': 0.02228,
      '''g''': 0.02015,
      '''h''': 0.06094,
      '''i''': 0.07546,
      '''j''': 0.00153,
      '''k''': 0.01292,
      '''l''': 0.04025,
      '''m''': 0.02406,
      '''n''': 0.06749,
      '''o''': 0.07507,
      '''p''': 0.01929,
      '''q''': 0.00095,
      '''r''': 0.07587,
      '''s''': 0.06327,
      '''t''': 0.09356,
      '''u''': 0.02758,
      '''v''': 0.00978,
      '''w''': 0.02560,
      '''x''': 0.00150,
      '''y''': 0.01994,
      '''z''': 0.00077,
  }
 else:
  # Custom frequencies dictionary
  _UpperCamelCase:  str    						=			frequencies_dict

 if not case_sensitive:
  _UpperCamelCase:  Union[str, Any]    						=			ciphertext.lower()

 # Chi squared statistic values
 _UpperCamelCase:  dict[int, tuple[float, str]]    						=			{}

 # cycle through all of the shifts
 for shift in range(len(lowercase		)		):
  _UpperCamelCase:  Tuple    						=			''''''

  # decrypt the message with the shift
  for letter in ciphertext:
   try:
    # Try to index the letter in the alphabet
    _UpperCamelCase:  Optional[int]    						=			(alphabet_letters.index(letter.lower()		) - shift) % len(
        lowercase		)
    decrypted_with_shift += (
        alphabet_letters[new_key].upper()
        if case_sensitive and letter.isupper()
        else alphabet_letters[new_key]
    )
   except ValueError:
    # Append the character if it isn't in the alphabet
    decrypted_with_shift += letter

  _UpperCamelCase:  Optional[int]    						=			0.0

  # Loop through each letter in the decoded message with the shift
  for letter in decrypted_with_shift:
   if case_sensitive:
    _UpperCamelCase:  Optional[int]    						=			letter.lower()
    if letter in frequencies:
     # Get the amount of times the letter occurs in the message
     _UpperCamelCase:  Any    						=			decrypted_with_shift.lower().count(lowercase		)

     # Get the excepcted amount of times the letter should appear based
     # on letter frequencies
     _UpperCamelCase:  int    						=			frequencies[letter] * occurrences

     # Complete the chi squared statistic formula
     _UpperCamelCase:  int    						=			((occurrences - expected) ** 2) / expected

     # Add the margin of error to the total chi squared statistic
     chi_squared_statistic += chi_letter_value
   else:
    if letter.lower() in frequencies:
     # Get the amount of times the letter occurs in the message
     _UpperCamelCase:  List[Any]    						=			decrypted_with_shift.count(lowercase		)

     # Get the excepcted amount of times the letter should appear based
     # on letter frequencies
     _UpperCamelCase:  Union[str, Any]    						=			frequencies[letter] * occurrences

     # Complete the chi squared statistic formula
     _UpperCamelCase:  List[str]    						=			((occurrences - expected) ** 2) / expected

     # Add the margin of error to the total chi squared statistic
     chi_squared_statistic += chi_letter_value

        # Add the data to the chi_squared_statistic_values dictionary
  _UpperCamelCase:  List[Any]    						=			(
      chi_squared_statistic,
      decrypted_with_shift,
  )

 # Get the most likely cipher by finding the cipher with the smallest chi squared
 # statistic
 def chi_squared_statistic_values_sorting_key(lowercase:				int		) -> tuple[float, str]:
  return chi_squared_statistic_values[key]

 _UpperCamelCase:  int    						=			min(
     lowercase	,       key=lowercase	,       )

 # Get all the data from the most likely cipher (key, decoded message)
 (
     (
     _UpperCamelCase
 )						,				(
     _UpperCamelCase
 )						,				
 ):  str    						=			chi_squared_statistic_values[most_likely_cipher]

 # Return the data on the most likely shift
 return (
     most_likely_cipher,
     most_likely_cipher_chi_squared_value,
     decoded_most_likely_cipher,
 )