Give a big$-$O estimate on the size of the output s based on the size of the input n for the following algorithm

Procedure fun $($n: integer$)$

S:$=0$

For i :$=$ to n do

For j :$=1$ to $4$n do