I have a list of integers, e.g. i=[1,7,3,1,5] which I first transform to a list of the respective binary representations of length L, e.g. b=[“001″,”111″,”011″,”001″,”101”] with L=3. Now I want to compute at how many of the L positions in the binary representation there is a 1 as well as a zero 0. In my example the result would be