Initially, a natural number $n$ is written on the blackboard. Then, at each minute, Esmeralda chooses a divisor $d>1$ of $n$, erases $n$, and writes $n+d$. If the initial number on the board is $2022$, what is the largest composite number that Esmeralda will never be able to write on the blackboard?