you give sequence consist n integer a_1 a_2 dots a_n integer x your task sequence sort consider sorted condition a_1 le a_2 le a_3 le dots le a_n holdsto sequence sort perform follow operation number time want possibly zero choose integer 1 le le n a_i x swap value a_i xFor example 0 2 3 5 4 x 1 follow sequence operation possible choose 2 possible a_2 x 0 1 3 5 4 x 2 choose 3 possible a_3 x 0 1 2 5 4 x 3 choose 4 possible a_4 x 0 1 2 3 4 x 5 calculate minimum number operation perform sorted report impossible