Given a starting number, a multiple and a divisor, find out how many times you need to repeat the operation x = x * multiple / divisor, using int division meaning truncation is possible, where the first value of x is the starting number, in order for x to reach 0. Preconditions: multiple and divisor are both non-zero, and |divisor| > |multiple| (the divisor will have a larger absolute value than the multiple).

HINT: You need to count the number of loops, but don't know how many there will be in advance. What kind of loop structure makes the most sense here?