Halve Until One

Repeatedly divide n by 2, dropping any remainder (integer division), until it becomes 1. Count how many divisions that takes.

Implement halve_until_one(n).

Input

n: A positive integer.

Output

Return the number of divisions.

Restricciones

1 ≤ n ≤ 1,000,000,000,000

Ejemplos

Entrada:
n = 20

Salida esperada:
expected = 4

Entrada:
long long n = 20;

Salida esperada:
long long expected = 4;

Entrada:
long n = 20;

Salida esperada:
long expected = 4;

Entrada:
n = 1

Salida esperada:
expected = 0

Entrada:
long long n = 1;

Salida esperada:
long long expected = 0;

Entrada:
long n = 1;

Salida esperada:
long expected = 0;

Referencias

Este reto está adaptado para CodeUtility. Sigue el enunciado y las restricciones indicadas arriba.

• GWU CS1111 Introduction to Software Development - lab sequence