Determine whether two numbers can be made equal under a simple bitwise condition.
You are given two integers. Check whether they satisfy the condition required by the problem statement on Codeforces 869A and decide if the answer is possible.
This is a short implementation-style problem focused on inspecting the binary representation of the numbers and applying the stated rule exactly.
Output YES if the condition holds, otherwise output NO.
YES if the condition is satisfied.NO.Example 1
Input
1 2
Output
YES
Explanation
This illustrates the kind of binary-condition check the task asks for. The answer depends on whether the rule is satisfied for the two given numbers.
Premium problem context
Premium adds guided hints, editorial links, similar variants, discussion resources, and concept maps so you can understand why a problem matters, not just solve it once.