Given a positive integer $n$, let $s(n)$ denote the sum of the digits of $n$. Compute the largest positive integer $n$ such that:

$$n = s(n)^2 + 2s(n) - 2.$$

Let's think step by step and output the final answer within \boxed{}.
user