Find sum of numbers which has only 2 1's in it's binary form

twoBinSum.py

# give input in single line with spaces
nos = map(int, (raw_input()).split(' '))

totalSum = 0

for n in nos:
    count = 0
    tmpN = n
    while n:
        n &= (n-1)
        count += 1
        if count > 2:
            break
    
    if count == 2:
        totalSum += tmpN

print totalSum