//这道题要注意输入的每个字符都等于seed的情况,此时输出1而不是0
#include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<queue>
#include <set>
using namespace std;
typedef unsigned long long ull;
int main()
{
int T;
int N;
char c,ch;
scanf("%d",&T);
while(T--)
{
int coun=0;
scanf("%d",&N);
getchar();
scanf("%c",&c);
getchar();
for(int i=0; i<N; i++)
{
scanf("%c",&ch);
if(c==ch&&coun==0)
continue;
if(c!=ch&&abs(c-ch)<10&&coun==0)
coun+=1;
else
coun+=2;
}
if(coun!=0)
printf("%d\n",coun);
else
printf("1\n");
getchar();
}
return 0;
}