#use 1st line for permutations
from itertools import permutations

li=[]
ans =[]
re = []
li = list(permutations(input))
for i in li:
s =0
for j in range(len(i)):
op = 2**j
s += i[j]//op
ans.append(s)
for i in input3:
a =0
for j in ans:
if i<=j:
a+= 1
re.append(a)
return(re)

Farmer jhons dilemma ✅
(Python 3)