from sys import *
input=stdin.readline
def out(l):
print(' '.join(map(str,l)))
def yes():
print('Yes')
def no():
print('No')
def alice():
print('Alice')
def bob():
print('Bob')
def solve():
n=int(input())
l=list(map(int,input().split()))
ans=min(l[0],l[1])
for i in range(n-2):
l1=[l[i],l[i+1],l[i+2]]
l1.sort()
ans=max(ans,l1[1])
print(ans)
for _ in range(int(input())):
solve()
1654C - Alice and the Cake | 369A - Valera and Plates |
1626A - Equidistant Letters | 977D - Divide by three multiply by two |
1654B - Prefix Removals | 1654A - Maximum Cake Tastiness |
1649A - Game | 139A - Petr and Book |
1612A - Distance | 520A - Pangram |
124A - The number of positions | 1041A - Heist |
901A - Hashing Trees | 1283A - Minutes Before the New Year |
1654D - Potion Brewing Class | 1107B - Digital root |
25A - IQ test | 785A - Anton and Polyhedrons |
1542B - Plus and Multiply | 306A - Candies |
1651C - Fault-tolerant Network | 870A - Search for Pretty Integers |
1174A - Ehab Fails to Be Thanos | 1169A - Circle Metro |
780C - Andryusha and Colored Balloons | 1153A - Serval and Bus |
1487C - Minimum Ties | 1136A - Nastya Is Reading a Book |
1353B - Two Arrays And Swaps | 1490E - Accidental Victory |