lensome knight

#include<bits/stdc++.h>
using namespace std;
typedef long long           ll;
typedef unsigned long long  ull;

#define testcase            int t; cin>>t; while (t--)
#define sc(a)               scanf("%lld",&a)
#define sc2(a,b)            scanf("%lld %lld",&a,&b)
#define reversed(s)         reverse(s.begin(), s.end())
#define asort(s)            sort(s.begin(), s.end())
#define dsort(s)            sort(s.begin(), s.end(),greater<ll>())
#define gtl(x)              getline(cin, (x))
#define PI                  acos(-1)
#define Precision(a)        cout << fixed << setprecision(a)
#define FasterIo            ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);

template <typename T> T Sqr(T x) { T n = x * x ; return n ;}
template <typename T> T Pow(T B,T P){ if(P==0) return 1; if(P&1) return B*Pow(B,P-1);  else return Sqr(Pow(B,P/2));}
template <typename T> T Abs(T a) {if(a<0)return -a;else return a;}
template <typename T> T Gcd(T a,T b){if(a<0)return Gcd(-a,b);if(b<0)return Gcd(a,-b);return (b==0)?a:Gcd(b,a%b);}
template <typename T> T Lcm(T a,T b) {if(a<0)return Lcm(-a,b);if(b<0)return Lcm(a,-b);return a*(b/Gcd(a,b));}

int knight[8][8]={2,3,4,4,4,4,3,2,
                  3,4,6,6,6,6,4,3,
                  4,6,8,8,8,8,6,4,
                  4,6,8,8,8,8,6,4,
                  4,6,8,8,8,8,6,4,
                  4,6,8,8,8,8,6,4,
                  3,4,6,6,6,6,4,3,
                  2,3,4,4,4,4,3,2};

int main()
{
    FasterIo
    testcase
    {
        char l, d;
        int intl, intd;
        cin >> l >> d;
        intl = l-'a'+1;
        intd = d-'0';
        cout << knight[intl-1][intd-1] << endl;

    }
    return 0;
}