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: For a certain positive integer $n,$ there exist real numbers $x_1,$ $x_2,$ $\dots,$ $x_n$ such that
\begin{align*}
x_1 + x_2 + x_3 + \dots + x_n &= 1000, \\
x_1^4 + x_2^4 + x_3^4 + \dots + x_n^4 &= 512000.
\end{align*}Find the smallest positive integer $n$ for which this is possible.
user