Divisibility · Challenge problem

A troop of soldiers, when lined up in rows of $8$, $10$, or $12$, always has exactly $5$ soldiers left over. When lined up in rows of $13$, none are left over. Find the smallest possible number of soldiers.