



"""simple docstring"""






def 							A__ (     UpperCamelCase__       ,							UpperCamelCase__    ):


  '''simple docstring'''


  return (input_a, input_a).count(0    ) % 2


def 							A__ (     ):


  '''simple docstring'''


  assert xor_gate(0       ,							0    ) == 0
  assert xor_gate(0       ,							1    ) == 1
  assert xor_gate(1       ,							0    ) == 1
  assert xor_gate(1       ,							1    ) == 0


if __name__ == "__main__":
    print(xor_gate(0, 0))
    print(xor_gate(0, 1))






from __future__ import annotations

import sys
class 							__lowercase   :



     def __init__(  self   :							Any      ,		lowercase__   :							str      ,		lowercase__   :							int       ):
       a_		    =  letter
       a_		    =  freq
       a_		    =  {}



     def __repr__(  self   :							List[Any]       ):
       return f"{self.letter}:{self.freq}"



class 							__lowercase   :



     def __init__(  self   :							Optional[int]      ,		lowercase__   :							int      ,		lowercase__   :							Letter | TreeNode      ,		lowercase__   :							Letter | TreeNode       ):
       a_		    =  freq
       a_		    =  left
       a_		    =  right






def 				UpperCAmelCase__  (							_A			):






  """simple docstring"""


  a_		    =  {}
  with open(_A			) as f:
    while True:
      a_		    =  f.read(1			)
      if not c:
        break
      a_		    =  chars[c] + 1 if c in chars else 1
  return sorted((Letter(_A      ,      _A			) for c, f in chars.items())      ,      key=lambda _A			: x.freq			)






def 				UpperCAmelCase__  (							_A			):






  """simple docstring"""


  a_		    =  letters  # type: ignore
  while len(_A			) > 1:
    a_		    =  response.pop(0			)
    a_		    =  response.pop(0			)
    a_		    =  left.freq + right.freq
    a_		    =  TreeNode(_A      ,      _A      ,      _A			)
    response.append(_A			)
    response.sort(key=lambda _A			: x.freq			)
  return response[0]






def 				UpperCAmelCase__  (							_A      ,      _A			):






  """simple docstring"""


  if isinstance(_A      ,      _A			):
    a_		    =  bitstring
    return [root]
  a_		    =  root  # type: ignore
  a_		    =  []
  letters += traverse_tree(treenode.left      ,      bitstring + '''0'''			)
  letters += traverse_tree(treenode.right      ,      bitstring + '''1'''			)
  return letters






def 				UpperCAmelCase__  (							_A			):






  """simple docstring"""


  a_		    =  parse_file(_A			)
  a_		    =  build_tree(_A			)
  a_		    =  {
      k: v for letter in traverse_tree(_A      ,      ''''''			) for k, v in letter.bitstring.items()
  }
  print(f"Huffman Coding  of {file_path}: "			)
  with open(_A			) as f:
    while True:
      a_		    =  f.read(1			)
      if not c:
        break
      print(letters[c]      ,      end=''' '''			)
  print()


if __name__ == "__main__":
  # pass the file path to the huffman function
  huffman(sys.argv[1])
