Code Challange for study purposes

Create an algorithm to solve the BDD described bellow:

Given

9

When I count the greatest number of zeros rounded by one into the Binary representation of the number

1001

Then Return

2

And

Given

529

When I count the greatest number of zeros rounded by one into the Binary representation of the number

1000010001

Then Return

4

And

Given

1041

When I count the greatest number of zeros rounded by one into the Binary representation of the number

10000010001

Then Return

5