KöMaL 2023 A863

Let $n\ge 2$ be a given integer. Find the greatest value of $N$, for which the following is true: there are infinitely many ways to find $N$ consecutive integers such that none of them has a divisor greater than 1 that is a perfect $n^{\mathrm{th}}$ power.