Memory distribution

Given a memory block of size N$.$ You can divide the memory bloc a way that fulfills the following two conditions:

After the division, each memory block should have lengths $B,$ or $C.$

After the division, the number of memory blocks should be maximum.

You are given integers $N,A,B,$ and $C.$ Print the maximum possibl number of memory blocks. It is guaranteed that at least one corr memory division exists.

Function description

Complete the function Memory$().$ This function takes the followin arameters and returns the required answer:

$N$ : Represents the size of the block

$A$ : Represents the first valid division length

B: Represents the second valid division length

Represents the third valid division length