OMM 1991 Problem 2

A company of $n$ soldiers is such that (i) $n$ is a palindrome number (read equally in both directions); (ii) if the soldiers arrange in rows of $3, 4$ or $5$ soldiers, then the last row contains $2, 3$ and $5$ soldiers, respectively. Find the smallest $n$ satisfying these conditions and prove that there are infinitely many such numbers $n$ .