You are given: N colors, numbered from 1 to N . For each color i , Chef has A i balls of that color. Chef will use some boxes. Each ball must go into exactly one box. Constraint: No box can contain two balls of the same color. You must find the minimum number of boxes needed. Problem Restatement For each test case: You know how many balls of each color Chef has. You must place them into boxes such that: Each ball goes into exactly one box. A box can contain multiple balls, but all of different colors . Goal: Minimize the number of boxes. Input Format: First line: T — number of test cases. For each test case: First line: N — number of colors. Second line: N integers A1, A2, ...., An where A i is the number of balls of color i . Output Format: For each test case, print the minimum number of boxes required. Constraints: 1 ≤ T ≤ 1000 2 ≤ N ≤ 100 1 ≤ A i ≤...