mod = 1000000007
eps = 10**-9


def main():
    import sys
    input = sys.stdin.buffer.readline

    class Bit:
        def __init__(self, n):
            self.size = n
            self.tree = [0] * (n + 1)

        def sum(self, i):
            s = 0
            while i > 0:
                s += self.tree[i]
                i -= i & -i
            return s

        def add(self, i, x):
            while i <= self.size:
                self.tree[i] += x
                i += i & -i

        def lower_bound(self, w):
            if w <= 0:
                return 0
            x = 0
            k = 1 << (self.size.bit_length() - 1)
            while k:
                if x + k <= self.size and self.tree[x + k] < w:
                    w -= self.tree[x + k]
                    x += k
                k >>= 1
            return x + 1

    for _ in range(int(input())):
        N = int(input())
        P = list(map(int, input().split()))

        ans = 2

        idx = {p: i for i, p in enumerate(P)}
        add = 1
        cnt = 0
        for p in range(1, N+1):
            cnt += 1
            i = idx[p]
            if i == 0:
                add -= 1
            else:
                if P[i - 1] < p:
                    cnt -= 1
            if i == N - 1:
                add -= 1
            else:
                if P[i + 1] < p:
                    cnt -= 1
            ans = max(ans, cnt * 2 + add)
        print(ans)


if __name__ == '__main__':
    main()