code: 
  
  
  from .hash_table import HashTable
  from .number_theory.prime_numbers import is_prime, next_prime
  
  class 						snake_case			(       lowerCAmelCase__	):
  			'''simple docstring'''
  
  			def __init__(	self     :     List[str]							,							*lowerCAmelCase_     :     int							,							**lowerCAmelCase_     :     int					)					->					Union[str, Any]:
  
  
  
  
  								"""simple docstring"""
  
  
  
  
  
  
  								super().__init__(*lowerCAmelCase_							,							**lowerCAmelCase_					)
  
  			def _lowercase (	self     :     Tuple							,							lowerCAmelCase_     :     Optional[int]							,							lowerCAmelCase_     :     Any					)					->					int:
  
  
  
  
  								"""simple docstring"""
  
  
  
  
  
  
  								SCREAMING_SNAKE_CASE_	      =       (
  								    next_prime(value % self.size_table					)
  								    if not is_prime(value % self.size_table					)
  								    else value % self.size_table
  								)  # gt = bigger than
  								return next_prime_gt - (data % next_prime_gt)
  
  			def _lowercase (	self     :     Any							,							lowerCAmelCase_     :     int							,							lowerCAmelCase_     :     int							,							lowerCAmelCase_     :     List[Any]					)					->					Dict:
  
  
  
  
  								"""simple docstring"""
  
  
  
  
  
  
  								return (increment * self.__hash_function_a(lowerCAmelCase_							,							lowerCAmelCase_					)) % self.size_table
  
  
  
  
  			def _lowercase (	self     :     int							,							lowerCAmelCase_     :     Dict							,							lowerCAmelCase_     :     Tuple=None					)					->					List[str]:
  
  
  
  
  								"""simple docstring"""
  
  
  
  
  
  
  								SCREAMING_SNAKE_CASE_	      =       1
  								SCREAMING_SNAKE_CASE_	      =       self.hash_function(lowerCAmelCase_					)
  
  								while self.values[new_key] is not None and self.values[new_key] != key:
  													SCREAMING_SNAKE_CASE_	      =       (
  													    self.__hash_double_function(lowerCAmelCase_							,							lowerCAmelCase_							,							lowerCAmelCase_					)
  													    if self.balanced_factor() >= self.lim_charge
  													    else None
  													)
  													if new_key is None:
  																		break
  													else:
  																		i += 1
  
  								return new_key
  
  
  
style_context: 
  
  
  def 							UpperCAmelCase				(     UpperCAmelCase				,UpperCAmelCase      )->		int:
  
  
  
  
  
  
  
  					'''simple docstring'''
  
  
  
  					return (input_a, input_a).count(0      ) % 2
  
  
  
  
  
  
  
  def 							UpperCAmelCase				(     )->		None:
  
  
  
  
  
  
  
  					'''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))
  
  
  