t = int(input())
for i in range(t):
n = int(input())
s = input()
a = [0]*26
for i in range(n):
a[ord(s[i])-65] += 1
s = 0
for i in range(26):
if(a[i]!= 0):
s += a[i] + 1
print(s)
#include<bits/stdc++.h>
using namespace std;
#define int long long
signed main()
{
ios_base::sync_with_stdio(0);
int t;
cin>>t;
while(t--){
int n;
cin>>n;
string s;
cin>>s;
map<char,int> m;
int ans=0;
for (int i = 0; i < n; i++)
{
if (m[s[i]]==0)
{
ans+=2;
m[s[i]]++;
}
else ans++;
}
cout<<ans<<endl;
}
}
994. Rotting Oranges | 983. Minimum Cost For Tickets |
973. K Closest Points to Origin | 969. Pancake Sorting |
967. Numbers With Same Consecutive Differences | 957. Prison Cells After N Days |
946. Validate Stack Sequences | 921. Minimum Add to Make Parentheses Valid |
881. Boats to Save People | 497. Random Point in Non-overlapping Rectangles |
528. Random Pick with Weight | 470. Implement Rand10() Using Rand7() |
866. Prime Palindrome | 1516A - Tit for Tat |
622. Design Circular Queue | 814. Binary Tree Pruning |
791. Custom Sort String | 787. Cheapest Flights Within K Stops |
779. K-th Symbol in Grammar | 701. Insert into a Binary Search Tree |
429. N-ary Tree Level Order Traversal | 739. Daily Temperatures |
647. Palindromic Substrings | 583. Delete Operation for Two Strings |
518. Coin Change 2 | 516. Longest Palindromic Subsequence |
468. Validate IP Address | 450. Delete Node in a BST |
445. Add Two Numbers II | 442. Find All Duplicates in an Array |