print an integer value representing the number of distributions

The warehouse of an e-commerce company has limited stock available for
each item due to a promotional sale. The company needs to distribute
this stock to its distribution center in a particular manner. If the
value of the available stock for an item is an even number, then the
total stock is divided by 2. If it is an odd number, 1 is subtracted
from it. The company wishes to know how many distributions can take
place before the stock reaches 0. Write an algorithm to calculate the
number of distributions that can take place before the stock reaches 0.
Input The input consists of an integer -num Stocks, representing the
stock available for the item (N)