Algorithm to a match a number in the array with any other number in the array plus lenth(binary representation of that no

See more:

algorithm

Python2.7

Let, a number n support a number (n+x), where x is the number of bits in the binary representation of n, like if n = 10, whose binary representation is 1010, i.e x=4; then it supports (10+4)=14. Now, in the questions, you are provided with an array of numbers. You have to print "SUPPORTED BY THE NUMBER (X)" if number is supported by any number 'X ' in the list and "NOT SUPPORTED" if there are no such number. If the array has duplicate entry, the function should print "Number 'X' has duplicate entry". How can i build the logic in python

What I have tried:

def numberSup(A):
dict_1 = []*1000
list_a = []
set_a = ()
A.sort()
k = list(("{0:b}".format(i) for i in A))
gen = list((int(i) for i in k))
if len(set(gen))!= len(A):
    print("Duplicate Elements are not allowed"),A,gen

for i in A:
    for j in gen:
        key =  i + len(str(j))

Now How will i store the sum from both the lists as i traverse through both of them namely A and gen.?