you give array consist n positive integer you perform operation itIn operation replace element array a_i lfloor fraca_i2 rfloor integer divide a_i 2 round downsee apply operation number time possible 0 array permutation number 1 nthat contain number 1 n exactly oncefor example 1 8 25 2 n 4 answer yes you follow replace 8 lfloor frac82 rfloor 4 1 4 25 2 replace 25 lfloor frac252 rfloor 12 1 4 12 2 replace 12 lfloor frac122 rfloor 6 1 4 6 2 replace 6 lfloor frac62 rfloor 3 1 4 3 2