Модуль: USE-2022. Question 15. Sets and logic

Задача

Let's introduce the expression M & K, denoting the bitwise conjunction of M and K (logical AND between the corresponding bits of the binary notation). Determine the smallest natural number A such that the expression
(X & 35 ≠ 0) → ((X & 31 = 0)  →  (X & A ≠ 0))
is identically true (that is, takes on the value 1 for any natural value of the variable X)?