Homework $2$ problem #$4$b seems to be an infinite loop for any input greater than $1.$ If so$,$ Big O would not apply $($because the program does not terminate$).$ Is anyone else seeing the same or am I misunderstanding?

int $i=n$;

while $)>(1$

$\{$

$5$; I$/$ Assume S$\text{'}$s time complexity is $O(1)$

$i=i^{*}2$;

$\}$;