Division DIVEO

Chef has an integer $N$. He repeats the following operation until $N$ becomes $1$.

• Chef chooses an integer $X$ such that $X \gt 1$ and $X$ is a divisor of $N$ and then divides $N$ by $X$ (the new value of $N$ becomes $N/X$). If $X$ is even, Chef gets $A$ points otherwise he gets $B$ points

Can you find the maximum points Chef can get if he performs the operations optimally?