位运算，右移统计连续1的个数，更新全局最大连续1的个数

#include <iostream>
#include <algorithm>

using namespace std;

int main() {
    int num = 0;

    while (cin >> num) {
        int res = 0;
        int cur = 0;
        while (num) {
            int n = num & 1;
            num = num >> 1;
            if (n) {
                ++cur;
            }
            else {
                cur = 0;
            }
            res = max(res, cur);
        }
        cout << res << endl;
    }


    return 0;
}