t = int(input())
for i in range(t):
s = input()
r = ord(s[0])- 96
c = ord(s[1])- 96
print((r-1)*26 + c - (r - 1) - ((0,1)[c>r]))
#include <bits/stdc++.h>
typedef long long ll;
using namespace std;
int main()
{
int t;
cin>>t;
while(t--){
int n,k;
string s;
cin>>s;
n=(s[0]-'a')*25;
if(s[0]-'a'>s[1]-'a'){
n=n+(s[1]-'a')+1;
}else n=n+(s[1]-'a');
cout<<n;
cout<<endl;
}
return 0;
}
1713B - Optimal Reduction | 1710A - Color the Picture |
1686B - Odd Subarrays | 251A - Points on Line |
427C - Checkposts | 1159A - A pile of stones |
508A - Pasha and Pixels | 912A - Tricky Alchemy |
1249A - Yet Another Dividing into Teams | 1713C - Build Permutation |
1699A - The Third Three Number Problem | 1617B - GCD Problem |
841A - Generous Kefa | 1690B - Array Decrements |
1692C - Where's the Bishop | 104A - Blackjack |
1438A - Specific Tastes of Andre | 1711C - Color the Picture |
1194C - From S To T | 110B - Lucky String |
1114A - Got Any Grapes | 224B - Array |
125B - Simple XML | 567B - Berland National Library |
431B - Shower Line | 282C - XOR and OR |
1582B - Luntik and Subsequences | 609A - Флеш-карты |
1207A - There Are Two Types Of Burgers | 371C - Hamburgers |