ILL 1977 Problem 26

Let $p$ be a prime number greater than $5.$ Let $V$ be the collection of all positive integers $n$ that can be written in the form $n = kp + 1$ or $n = kp - 1 \ (k = 1, 2, \ldots).$ A number $n \in V$ is called indecomposable in $V$ if it is impossible to find $k, l \in V$ such that $n = kl.$ Prove that there exists a number $N \in V$ that can be factorized into indecomposable factors in $V$ in more than one way.