Answer Happy

Given five input numbers, a, b, c, d and n, print out the numberof 1 bits at the nth least significant bit position in all fournumbers a, b, c, d. In my code it only satisfy some of the examplebut not all of them, any suggestion on what to change or add?
My Code-
number = input()numbers=number.split()
val1=int(numbers[1])val2=int(numbers[2])val3=int(numbers[3])val4=int(numbers[3])val5=int(numbers[-1])#Extract the lsb from each valuenum1=val1&1num2=val2&1num3=val3&1num4=val4&1num5=val5&1
#Add all the lsb
sum = num1+num2+num3+num4+num5print(sum)
Given five input numbers, a,b,c,d and n, print out the number of 1 bits at the nth least significant bit position in all four numbers a, b, c, d. Criteria: Example input I 11110 Example output 4 All numbers a,b,c and d are 1 - binary equivalent of which is 0001 . Since n is 0 in the input, nth Isb position is the last bit position. In all four number the last bit position is 1, counting them results in 4.