Tricky inheritance

There is a famous problem called $17$ camels and $3$ sons , where an old man owns $17$ camels that he wishes to be shared by his three sons after his death as follows: $\frac{1}{2}$ for the eldest son, $\frac{1}{3}$ for the second, and $\frac{1}{9}$ for the youngest.

Since $17$ is not divisible by either $2, 3,$ or $9,$ the three sons consult a wise man, who proposes to lend them an extra camel. Now the eldest son can get his share of $\frac{18}{2} = 9$ camels, the second $\frac{18}{3} = 6,$ and the youngest $\frac{18}{9} = 2,$ for a total of $9+6+2=17$ camels. The extra camel can then be returned to the wise man.

Suppose now that the father has $N$ camels and wants to divide the herd as follows: $\frac{1}{2}$ for the eldest son, $\frac{1}{4}$ for the second, and $\frac{1}{5}$ for the youngest. For which of the following values of $N$ can the three sons apply the same borrowing strategy to ensure that the new herd will be divided fairly and that every borrowed camel will be returned to the wise man?