God of Battle

Gisung has never lost a battle. Mingyeong, who loses every battle, kept begging Gisung to share the secret to winning. Tired of the pestering, Gisung told Mingyeong his own formula for choosing the mercenaries who join a battle. Mingyeong hires mercenaries according to that formula.

According to Gisung's formula, if one tanker has combat power $A$ and one dealer has combat power $B$, Mingyeong hires $x$ tankers and $y$ dealers so that $Ax + By$ is maximized.

Mingyeong has only $N$ won to spend on hiring, so the hiring is limited. If hiring one tanker costs $P_A$ and hiring one dealer costs $P_B$, write a program that finds how many tankers and how many dealers Mingyeong should hire.

The first line contains $N$, the amount of money Mingyeong can spend on hiring mercenaries. $(1 \leq N \leq 10{,}000{,}000)$

The second line contains $A$, $P_A$, $B$, and $P_B$, separated by spaces. $(1 \leq A, B \leq 10{,}000;\ 1 \leq P_A, P_B \leq 10{,}000{,}000)$

All input values are integers.

Print the number of tankers and the number of dealers to hire, separated by a space.