You are given a digital clock with nn digits. Each digit shows an integer from 00 to 99, so the whole clock shows an integer from 00 to 10n−110n−1. The clock will show leading zeroes if the number is smaller than 10n−110n−1.
You want the clock to show 00 with as few operations as possible. In an operation, you can do one of the following:
- decrease the number on the clock by 11, or
- swap two digits (you can choose which digits to swap, and they don’t have to be adjacent).
Your task is to determine the minimum number of operations needed to make the clock show 00.Input
Each test contains multiple test cases. The first line contains the number of test cases tt (1≤t≤1031≤t≤103).
The first line of each test case contains a single integer nn (1≤n≤1001≤n≤100) — number of digits on the clock.
The second line of each test case contains a string of nn digits s1,s2,…,sns1,s2,…,sn (0≤s1,s2,…,sn≤90≤s1,s2,…,sn≤9) — the number on the clock.
Note: If the number is smaller than 10n−110n−1 the clock will show leading zeroes.Output
For each test case, print one integer: the minimum number of operations needed to make the clock show 00.ExampleinputCopy
7 3 007 4 1000 5 00000 3 103 4 2020 9 123456789 30 001678294039710047203946100020
7 2 0 5 6 53 115
In the first example, it’s optimal to just decrease the number 77 times.
In the second example, we can first swap the first and last position and then decrease the number by 11.
In the third example, the clock already shows 00, so we don’t have to perform any operations.