Slot Machines

Martha takes a jar of quarters to the casino, intending to get rich. She plays three machines in turn — machine $1$, then $2$, then $3$, then back to $1$, and so on. Unknown to her, the machines are entirely predictable. Each play costs one quarter.

• Machine $1$ pays $30$ quarters on every $35^{\text{th}}$ time it is played.
• Machine $2$ pays $60$ quarters on every $100^{\text{th}}$ time it is played.
• Machine $3$ pays $9$ quarters on every $10^{\text{th}}$ time it is played.

Whenever a machine pays out, its play counter resets to $0$. Martha keeps playing as long as she has at least one quarter, and goes broke when the jar is empty.

The input consists of four integers separated by spaces or newlines.

• The first integer is the number of quarters $Q$ in Martha's jar ($1 \le Q < 1000$).
• The next three integers are how many times machine $1$, machine $2$, and machine $3$ have each been played since they last paid out.

Print a single line with the total number of times Martha plays before going broke:

Martha plays N times before going broke.

where $N$ is the total number of plays.