#include <iostream>
#include <cstdio>
#include <queue>
#include <cstring>
using namespace std;
int x[8]={-2,-2,-1,-1,1,1,2,2},y[8]={-1,1,-2,2,2,- 2,1,-1};
struct pos{
int x,y,n;
};
char a,b,c,d;
bool inq[100][100];
int ans(int x0,int y0,int x2,int y2)
{
int xx,yy;
queue<pos>q;
q.push({x0,y0,0});
inq[x0][y0]=1;
while(!q.empty())
{
pos p=q.front();
q.pop();
if(p.x==x2&&p.y==y2)
return p.n;
for(int i=0;i<8;i++)
{
xx=p.x+x[i];yy=p.y+y[i];
if(xx>=1&&xx<=8&&yy>=1&&yy<=8&&!inq[xx][yy])
{
inq[xx][yy]=1;
q.push({xx,yy,p.n+1});
}
}
}
}
int main()
{
while(scanf("%c%c %c%c",&a,&b,&c,&d)!=EOF)
{
cout<<"To get from "<<a<<b<<" to "<<c<<d<<" takes "<<ans(a-'a'+1,b-'0',c-'a'+1,d-'0')<<" knight moves."<<endl;
getchar();
memset(inq,0,sizeof(inq));
}
return 0;
}