In an ICPC contest, balloons are distributed as follows:
-
Whenever a team solves a problem, that team gets a balloon.
-
The first team to solve a problem gets an additional balloon.
A contest has 26 problems, labelled A, B, C, ..., Z. You are given the order of solved problems in the contest, denoted as a string s, where the ii-th character indicates that the problem sisi has been solved by some team. No team will solve the same problem twice.
Determine the total number of balloons that the teams received. Note that some problems may be solved by none of the teams.
在ICPC比赛中,气球是这样分发的:
-
每当一支队伍做出了一题,他们就会得到一个气球。
-
第一支做出某道题的队伍会得到一个额外的气球。
一场比赛有 26 道题,标题为 A、B、C、…、Z ,你会得到竞赛中已解决问题的顺序,表示为字符串 s ,其中第 i 个字符表示问题 s[i] 已被某个团队解决。没有团队会两次解决同一个问题。
确定所有队伍收到的气球总数。注意,有些问题可能没有一个团队能够解决。
The first line of the input contains an integer t (1≤t≤100) — the number of testcases.
The first line of each test case contains an integer n (1≤n≤50) — the length of the string.
The second line of each test case contains a string s of length n consisting of uppercase English letters, denoting the order of solved problems.
输入的第一行包含一个整数 t (1≤t≤100)——测试用例的数量。
每个测试用例的第一行包含一个整数 n (1≤n≤50)—字符串的长度。
每个测试用例的第二行包含一个长度为 n 的只包括大写字母的字符串 s,表示已解决问题的顺序。
For each test case, output a single integer — the total number of balloons that the teams received.
对于每组测试用例,输出一个数字,代表当前所有队伍能获得的气球总数