code: 
  
  
  
  
  
  def 		_SCREAMING_SNAKE_CASE    (   lowerCAmelCase__       ,lowerCAmelCase__	):
  
  
  
  
  
  
  
  		if n < 0:
  				return 0
  		# table[i] represents the number of ways to get to amount i
  		lowerCamelCase_  :    Tuple   	=			[0] * (n + 1)
  
  		# There is exactly 1 way to get to zero(You pick no coins).
  		lowerCamelCase_  :    Union[str, Any]   	=			1
  
  		# Pick all coins one by one and update table[] values
  		# after the index greater than or equal to the value of the
  		# picked coin
  		for coin_val in s:
  				for j in range(lowercase__       ,n + 1	):
  						table[j] += table[j - coin_val]
  
  		return table[n]
  
  
  if __name__ == "__main__":
  		import doctest
  
  		doctest.testmod()
  
style_context: 
  
  
  
  
  
  def 		_SCREAMING_SNAKE_CASE    (   lowerCAmelCase__       ,lowerCAmelCase__	):
  		return (input_a, input_a).count(0	) % 2
  
  
  def 		_SCREAMING_SNAKE_CASE    (   ):
  		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))
  