import timeit
def solution_MK():
N = 91622823286
cnt = 0
result = 0
found_one = False
i = N
while i:
if i & 1 == 1:
if (found_one == False):
found_one = True
else:
result = max(result,cnt)
cnt = 0
else:
cnt += 1
i >>= 1
return result
def solution_SJ():
N = 91622823286
binstr = bin(N)[2:].strip("0")
binlst = str(binstr).split("1")
return len(max(binlst))
print timeit.timeit(solution_MK)
print timeit.timeit(solution_SJ)
aW1wb3J0IHRpbWVpdAoKZGVmIHNvbHV0aW9uX01LKCk6CiAgICBOID0gOTE2MjI4MjMyODYKICAgIGNudCA9IDAKICAgIHJlc3VsdCA9IDAKICAgIGZvdW5kX29uZSA9IEZhbHNlCgogICAgaSA9IE4KCiAgICB3aGlsZSBpOgogICAgICAgIGlmIGkgJiAxID09IDE6CiAgICAgICAgICAgIGlmIChmb3VuZF9vbmUgPT0gRmFsc2UpOgogICAgICAgICAgICAgICAgZm91bmRfb25lID0gVHJ1ZQogICAgICAgICAgICBlbHNlOgogICAgICAgICAgICAgICAgcmVzdWx0ID0gbWF4KHJlc3VsdCxjbnQpCiAgICAgICAgICAgIGNudCA9IDAKICAgICAgICBlbHNlOgogICAgICAgICAgICBjbnQgKz0gMQogICAgICAgIGkgPj49IDEKCiAgICByZXR1cm4gcmVzdWx0CgoKZGVmIHNvbHV0aW9uX1NKKCk6CiAgICBOID0gOTE2MjI4MjMyODYKICAgIGJpbnN0ciA9IGJpbihOKVsyOl0uc3RyaXAoIjAiKQogICAgYmlubHN0ID0gc3RyKGJpbnN0cikuc3BsaXQoIjEiKQogICAgcmV0dXJuIGxlbihtYXgoYmlubHN0KSkKCgpwcmludCB0aW1laXQudGltZWl0KHNvbHV0aW9uX01LKQpwcmludCB0aW1laXQudGltZWl0KHNvbHV0aW9uX1NKKQo=