Exact amount of loop iterations here? What is the exact number of loop iterations here and how do you find out?

def func(n):
  i = 4

  while i &lt; n:
    print(i)

  i = i + 1


The solution says max(n-4,0) which is theta(n), but I am confused about how they reached this. I see it starts from 4 and can guess that this relates to the n-4, but would like to be sure.
It will iterate $n-4$ steps if $n&gt;4$ . If  $n\leq4$  there will be no iteration since the condition is not satisfied. The important thing is that the linear search runtime grows like the sequence size in the worst case. The notation we use for works like $c_1.n+c_2$ is Θ (n).