Find the largest positive integer $n$ such that for each prime $p$ with $2 < p < n$, the difference $n - p$ is also a prime number.

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