#include using namespace std; #define ll long long #define endl '\n' ll pow(ll x,ll y,ll m=1e9+7){ll ans=1;x%=m;while(y){if(y&1)ans=(ans*x)%m;x=(x*x)%m;y>>=1;}return ans;} void solve() { int n; string s; vectorv(26,0); cin>>n>>s; int ans=0; for(auto x:s) { if(v[x-'A']==0) ans++; v[x-'A']++; ans++; } cout<> TCS; for (int TC = 1; TC <= TCS; ++TC) { // cout<<"Case "<