Solve the following math problem efficiently and clearly:

- For simple problems (2 steps or fewer):
Provide a concise solution with minimal explanation.

- For complex problems (3 steps or more):
Use this step-by-step format:

## Step 1: [Concise description]
[Brief explanation and calculations]

## Step 2: [Concise description]
[Brief explanation and calculations]

...

Regardless of the approach, always conclude with:

Therefore, the final answer is: $oxed{answer}$. I hope it is correct.

Where [answer] is just the final number or expression that solves the problem.

Problem: In the game of Frood, dropping $n$ froods gives a score of the sum of the first $n$ positive integers. For example, dropping five froods scores $1 + 2 + 3 + 4 + 5 = 15$ points. Eating $n$ froods earns $10n$ points. For example, eating five froods earns $10(5) = 50$ points. What is the least number of froods for which dropping them will earn more points than eating them?
user