Same Bits – Odd Positions

The program must accept two integers X and Y as the input. The program must print an integer C whose binary representation indicates the same bits at the odd positions from LSB(Least Significant Bit) of the integers X and Y. If there are no bits same at odd positions, then the program must print -1 as the output.

Boundary Condition(s):
1 <= X, Y <= 10^8

Input Format:
The first line contains X and Y separated by a space.

Output Format:
The first line contains C.

Example Input/Output 1:
Input:
109 107

Output:
5

Explanation:
109 -> 1101101
107 -> 1101011
1^st position from LSB: Same bit 1
3^rd position from LSB: Different bits
5^th position from LSB: Same bit 0
7^th position from LSB: Same bit 1
101 -> 5

Example Input/Output 2:
Input:
206 27

Output:
-1

Explanation:
206 -> 11001110
27 -> 00011011
1^st position from LSB: Different bits
3^rd position from LSB: Different bits
5^th position from LSB: Different bits
7^th position from LSB: Different bits
So -1 is printed.

Example Input/Output 3:
Input:
337 347

Output:
29

Explanation:
337 -> 101010001
347 -> 101011011
1^st position from LSB: Same bit 1
3^rd position from LSB: Same bit 0
5^th position from LSB: Same bit 1
7^th position from LSB: Same bit 1
9^th position from LSB: Same bit 1
11101 -> 29

x,y=map(int,input().split())
a=bin(x)[2:]
b=bin(y)[2:]
c,d=len(a),len(b)
m=max(c,d)
temp=[]
a=a.rjust(m,'0')
b=b.rjust(m,'0')
a,b=a[::-1],b[::-1]
for i in range(0,m,2):
    if a[i]==b[i]:
        temp.append(a[i])
temp=temp[::-1]
if len(temp)==0:
    print(-1)
else:
    t=''.join(temp)
    print(int(t,2))