Programmers' kids solve this riddle in 5-10 minutes. How fast can you do it?
The input contains a single integer *n* (0 ≤ *n* ≤ 2000000000).
none
11
2
14
0
61441
2
571576
10
2128506
3
0
1
2000000000
4
143165576
14
1741
2
1919020031
3
1795248373
5
1818960378
5
1285316221
3
1309028227
5
1304312649
8
1180540990
5
1204252996
3
1199537418
4
1075765759
2
724264821
5
747976826
4
624205168
4
619489590
4
643201595
5
638486017
6
514714359
3
833393692
3
186925426
4
210637432
4
58438190
4
x = int(input(""))
one = ['0', '4', '6', '9', 'a', 'c']
two = ['8', 'b']
count = 0
while(True):
    y = (hex(int(x % 16)))[2:]
    if(y in one):
        count += 1
    elif(y in two):
        count += 2
    x = int(x/16)
    if(x == 0):
        break
print(count)
