so this is the problem, It is an interactive problem, grader provides a_{i}.a_{j} for any two index i, j where 1<=i<=j<=6 and we’re suppose to return the correct permutation of the array [ 4, 8, 15, 16, 23, 42], can ask up to 4 queries.

so my doubt is how we’ll know exact index where a value belongs, like for input array 42 23 16 15 8 4

if by grader we are given value of a[3].a[5] which is 128, how I’ll know if value at index 3 needs to be 16 or 8.