B"You are given a digital clock with n digits. Each digit shows an integer from 0 to 9 , so the whole clock shows an integer from 0 to 10^n-1 . The clock will show leading zeroes if the number is smaller than 10^{n-1} . You want the clock to show 0 with as few operations as possible. In an operation, you can do one of the following: Your task is to determine the minimum number of operations needed to make the clock show 0 . Each test contains multiple test cases. The first line contains the number of test cases t ( 1 <= t <= 10^3 ). The first line of each test case contains a single integer n ( 1 <= n <= 100 ) -- number of digits on the clock. The second line of each test case contains a string of n digits s_1, s_2, ldots, s_n ( 0 <= s_1, s_2, ldots, s_n <= 9 ) -- the number on the clock. Note: If the number is smaller than 10^{n-1} the clock will show leading zeroes. For each test case, print one integer: the minimum number of operations needed to make the clock show 0 . In the first example, it's optimal to just decrease the number 7 times. In the second example, we can first swap the first and last position and then decrease the number by 1 . In the third example, the clock already shows 0 , so we don't have to perform any operations. "...