count $=0$;

For i $=1$ through n do

For p $=1$ through $10$ do

For k $=0$ through i$/2$ do

count $=$ count $+1$;

end for loops;

What is the value of the variable count in terms of n after the following algorithm fragment is executed?