Calculate the BigO complexity for the following function

for(int count = 0, i = 0; i < n * n; i++)

if( i % n == 0 )

for(int j = 0; j < i; j++)

count++;