






def 	lowerCamelCase   (		a_					,		a_      )      ->     Union[str, Any]:
							lowerCAmelCase_									=	len(_UpperCamelCase      )
							lowerCAmelCase_									=	len(_UpperCamelCase      )
							lowerCAmelCase_									=	[[False for _ in range(m + 1      )] for _ in range(n + 1      )]
							lowerCAmelCase_									=	True
							for i in range(_UpperCamelCase      ):
														for j in range(m + 1      ):
																					if dp[i][j]:
																												if j < m and a[i].upper() == b[j]:
																																			lowerCAmelCase_									=	True
																												if a[i].islower():
																																			lowerCAmelCase_									=	True
							return dp[n][m]


if __name__ == "__main__":
		import doctest

		doctest.testmod()








def 		a__      (		_UpperCamelCase      :			int			,_UpperCamelCase      :			int				):
   while second != 0:
      __lowerCamelCase    				=     first & second
      first ^= second
      __lowerCamelCase    				=     c << 1
   return first


if __name__ == "__main__":
  import doctest

  doctest.testmod()

  a_								=       int(input("""Enter the first number: """).strip())
  a_								=       int(input("""Enter the second number: """).strip())
  print(f"{add(first, second) = }")






