Count The Carries
One day, Implus gets interested in binary addition and binary carry. He will transfer all decimal digits to binary digits to make the addition. Not as clever as Gauss, to make the addition from a to b, he will add them one by one from a to b in order. For example, from 1 to 3 (decimal digit), he will firstly calculate 01 (1)+10 (2), get 11，then calculate 11+11 (3)，lastly 110 (binary digit), we can find that in the total process, only 2 binary carries happen. He wants to find out that quickly. Given a and b in decimal, we transfer into binary digits and use Implus's addition algorithm, how many carries are there？
Two integers a, b（0<=a<=b<1000000000), about 100000 cases, end with EOF.
One answer per line.
- 取第一个php foreach的结果并继续
- 严重性：警告消息：为foreach（）提供的参数无效文件名：helpers / form_helper.php