BIG-O QUESTION.

WHY IS THE FOLLOWING LOOP O(log N)?

int a = 0, i = N;

while (i > 0) {

a += i;

i /= 2;

}