you give array consist n integer in jump position position a_i 1 le a_i position a_i a_i le nFor position 1 n want know minimum number move require reach position j a_j opposite parity a_i ie a_i odd a_j vice versa