we secret array you do not know array restore however know fact array the array consist n distinct positive great 0 integer the array contain element x y element know x y if sort array increase order a_1 a_2 ldot a_n difference adjacent consecutive element equal ie a_2 a_1 a_3 a_2 ldot a_n a_n1 it prove array exist constraint give belowamong possible array satisfy give condition ask restore minimum possible maximum element in word minimize maxa_1 a_2 dot a_nyou answer t independent test case