Given a sequence where the \( n \)-th term is \( n^2 \), find the smallest positive integer \( n \) such that the sum of the squares of the first \( n \) positive integers is at least 5000. Let's think step by step and output the final answer within \boxed{}.
user