Check The Constraints

There are $N$ boosters with power $A[1],A[2],A[3]....A[N]$, You want to gain as much power as you can by following these steps: - First choose a booster and assign it to your power, suppose you took booster k then your power $P=A[k]$. - Choose a booster $A[k]$ such that $k$ should not equal to any index chosen in previous steps and multiply it to power($P=P*A[k]$). - Repeat step 2. You want to