Algorithm problem (minimum number of operations)?

990 multiplication operations for a^2 it is one multiplication, for a^3 it is 2 multiplications, for a^n it is n-1 as long as n-1>0