B"Monocarp is playing a computer game. He's going to kill n monsters, the i -th of them has h_i health. Monocarp's character has two spells, either of which he can cast an arbitrary number of times (possibly, zero) and in an arbitrary order: When a monster's health becomes 0 , it dies. What's the minimum number of spell casts Monocarp should perform in order to kill all monsters? The first line contains a single integer t ( 1 <= t <= 10^4 ) -- the number of testcases. The first line of each testcase contains a single integer n ( 1 <= n <= 100 ) -- the number of monsters. The second line contains n integers h_1, h_2, ... , h_n ( 1 <= h_i <= 100 ) -- the health of each monster. The sum of n over all testcases doesn't exceed 2 cdot 10^4 . For each testcase, print a single integer -- the minimum number of spell casts Monocarp should perform in order to kill all monsters. In the first testcase, the initial health list is [1, 2, 1, 2] . Three spells are casted: In the second testcase, the initial health list is [2, 4, 2] . Three spells are casted: In the third testcase, the initial health list is [1, 2, 3, 4, 5] . Five spells are casted. The i -th of them kills the i -th monster with the second spell. Health list sequence: [1, 2, 3, 4, 5] rightarrow [0, 2, 3, 4, 5] rightarrow [0, 0, 3, 4, 5] rightarrow [0, 0, 0, 4, 5] rightarrow [0, 0, 0, 0, 5] rightarrow [0, 0, 0, 0, 0] . "...