def 	__SCREAMING_SNAKE_CASE  (					__UpperCamelCase    :       int	)							->					list:







  """simple docstring"""





  if bit_count < 0:
    raise ValueError("""The given input must be positive"""	)

  # get the generated string sequence
  SCREAMING_SNAKE_CASE__										=      gray_code_sequence_string(__UpperCamelCase	)
  #
  # convert them to integers
  for i in range(len(__UpperCamelCase	)	):
    SCREAMING_SNAKE_CASE__										=      int(sequence[i] ,     2	)

  return sequence



def 	__SCREAMING_SNAKE_CASE  (					__UpperCamelCase    :       int	)							->					list:







  """simple docstring"""





  if bit_count == 0:
    return ["0"]

  if bit_count == 1:
    return ["0", "1"]

  SCREAMING_SNAKE_CASE__										=      1 << bit_count  # defines the length of the sequence
  # 1<< n is equivalent to 2^n

  # recursive answer will generate answer for n-1 bits
  SCREAMING_SNAKE_CASE__										=      gray_code_sequence_string(bit_count - 1	)

  SCREAMING_SNAKE_CASE__										=      []

  # append 0 to first half of the smaller sequence generated
  for i in range(seq_len // 2	):
    SCREAMING_SNAKE_CASE__										=      """0""" + smaller_sequence[i]
    sequence.append(__UpperCamelCase	)

  # append 1 to second half ... start from the end of the list
  for i in reversed(range(seq_len // 2	)	):
    SCREAMING_SNAKE_CASE__										=      """1""" + smaller_sequence[i]
    sequence.append(__UpperCamelCase	)

  return sequence


if __name__ == "__main__":
   import doctest

   doctest.testmod()

__lowerCamelCase			: List[Any]							   =		6_5521



def 	__SCREAMING_SNAKE_CASE  (					__UpperCamelCase    :       str	)							->					int:







  """simple docstring"""





  SCREAMING_SNAKE_CASE__										=      1
  SCREAMING_SNAKE_CASE__										=      0
  for plain_chr in plain_text:
    SCREAMING_SNAKE_CASE__										=      (a + ord(__UpperCamelCase	)) % MOD_ADLER
    SCREAMING_SNAKE_CASE__										=      (b + a) % MOD_ADLER
  return (b << 16) | a
