human
There are n heaps of stone. The i-th heap has h_i stones. You want to change the number of stones in the heap by performing the following process once: 

  * You go through the heaps from the 3-rd heap to the n-th heap, in this order. 
  * Let i be the number of the current heap. 
  * You can choose a number d (0 ≤ 3 ⋅ d ≤ h_i), move d stones from the i-th heap to the (i - 1)-th heap, and 2 ⋅ d stones from the i-th heap to the (i - 2)-th heap. 
  * So after that h_i is decreased by 3 ⋅ d, h_{i - 1} is increased by d, and h_{i - 2} is increased by 2 ⋅ d. 
  * You can choose different or same d for different operations. Some heaps may become empty, but they still count as heaps. 


What is the maximum number of stones in the smallest heap after the process?

Input

Each test contains multiple test cases. The first line contains the number of test cases t (1 ≤ t ≤ 2⋅ 10^5). Description of the test cases follows.

The first line of each test case contains a single integer n (3 ≤ n ≤ 2 ⋅ 10^5).

The second lines of each test case contains n integers h_1, h_2, h_3, …, h_n (1 ≤ h_i ≤ 10^9).

It is guaranteed that the sum of n over all test cases does not exceed 2 ⋅ 10^5.

Output

For each test case, print the maximum number of stones that the smallest heap can contain.

Example

Input

4
4
1 2 10 100
4
100 100 100 1
5
5 1 1 1 8
6
1 2 3 4 5 6

Output

7
1
1
3

Note

In the first test case, the initial heap sizes are [1, 2, 10, 100]. We can move the stones as follows. 

  * move 3 stones and 6 from the 3-rd heap to the 2-nd and 1 heap respectively. The heap sizes will be [7, 5, 1, 100].

  * move 6 stones and 12 stones from the last heap to the 3-rd and 2-nd heap respectively. The heap sizes will be [7, 17, 7, 82]. 


In the second test case, the last heap is 1, and we can not increase its size.

In the third test case, it is better not to move any stones.

In the last test case, the final achievable configuration of the heaps can be [3, 5, 3, 4, 3, 3].
The above is tricky. Write me a correct solution in PYTHON3.
assistant
#Here is Python program to print the maximum number of stones that the smallest heap can contain.

def main():
    
    def checkPossible(stones):
        a = h.copy()
        for i in range(n - 1, 1, -1): # go from right to left and move as many as possible
            if a[i] < stones:
                return False
            d = min((a[i] - stones) // 3, h[i] // 3)
            a[i] -= 3 * d
            a[i - 1] += d
            a[i - 2] += 2 * d
            # print('stones:{} i:{} d:{} a:{}'.format(stones, i, d, a))
        # for i in range(2, n): # move min stones required
        #     d1 = stones - a[i - 2]
        #     d = (d1 + 1) // 2
        #     d = max(0, d, (a[i] // 3) * 3)
        #     print('stones:{} i:{} d:{}'.format(stones, i, d))
        #     if a[i] < 3 * d:
        #         return False # impossible
        #     a[i - 2] += 2 * d
        #     a[i - 1] += d
        #     a[i] -= 3 * d
        # # check second last
        # d = max(0, stones - a[n - 2])
        # if a[n - 1] - stones < d * 3:
        #     return False
        # else:
        #     return True
        return a[0] >= stones and a[1] >= stones
            
        
    t = int(input())
    allans = []
    for _ in range(t):
        n = int(input())
        h = readIntArr()
        
        avg = (sum(h) + n - 1) // n
        
        # binary search
        twoPowers = []
        b = 1
        while b <= avg:
            twoPowers.append(b)
            b *= 2
        twoPowers.reverse()
        ans = 0
        for b in twoPowers:
            if ans + b <= avg and checkPossible(ans + b):
                ans += b
        allans.append(ans)
        
    multiLineArrayPrint(allans)
    
    return

import sys
input=sys.stdin.buffer.readline #FOR READING PURE INTEGER INPUTS (space separation ok)
# input=lambda: sys.stdin.readline().rstrip("\r\n") #FOR READING STRING/TEXT INPUTS.

def oneLineArrayPrint(arr):
    print(' '.join([str(x) for x in arr]))
def multiLineArrayPrint(arr):
    print('\n'.join([str(x) for x in arr]))
def multiLineArrayOfArraysPrint(arr):
    print('\n'.join([' '.join([str(x) for x in y]) for y in...