//Full Metal Compiler
#include <fstream>
#include <algorithm>
#include <sstream>
#include <cstdlib>
#include <cstring>
#include <string>
#include <deque>
#include <set>
#include <list>
#include <cmath>
#include <map>
using namespace std;

int main() {
	ifstream fin("data3.txt");
	ofstream fout("out3.txt");

	int i,j,n=5;
	string seq;
	char grid[19][10];
	int start[12][2];
	for (i=0;i<10;i++) {
		for (j=0;j<19;j++) {
			fin >> grid[j][i];
		}
	}
	int dist[91][91];
	dist['E']['B']=dist['B']['E']=14;
	dist['B']['F']=dist['F']['B']=dist['E']['J']=dist['J']['E']=6;
	dist['B']['G']=dist['G']['B']=dist['E']['I']=dist['I']['E']=7;
	dist['B']['I']=dist['I']['B']=dist['E']['G']=dist['G']['E']=9;
	dist['B']['J']=dist['J']['B']=dist['E']['F']=dist['F']['E']=10;
	dist['A']['A']=dist['B']['B']=dist['C']['C']=dist['D']['D']=dist['E']['E']=dist['F']['F']=dist['G']['G']=dist['H']['H']=dist['I']['I']=dist['J']['J']=dist['K']['K']=dist['L']['L']=0;
	dist['A']['B']=dist['B']['A']=dist['A']['E']=dist['E']['A']=dist['A']['F']=dist['F']['A']=dist['J']['A']=dist['A']['J']=11;
	dist['A']['G']=dist['G']['A']=dist['A']['I']=dist['I']['A']=12;
	dist['A']['C']=dist['A']['D']=dist['C']['A']=dist['D']['A']=dist['A']['K']=dist['K']['A']=dist['A']['L']=dist['L']['A']=13;
	dist['B']['K']=dist['K']['B']=dist['B']['C']=dist['C']['B']=dist['E']['D']=dist['D']['E']=dist['F']['K']=dist['K']['F']=dist['J']['L']=dist['L']['J']=dist['H']['B']=dist['B']['H']=dist['H']['E']=dist['E']['H']=dist['E']['L']=dist['L']['E']=8;
	dist['B']['L']=dist['L']['B']=dist['E']['K']=dist['K']['E']=dist['B']['D']=dist['D']['B']=dist['C']['E']=dist['E']['C']=16;
	dist['C']['K']=dist['K']['C']=dist['D']['L']=dist['L']['D']=6;
	dist['A']['H']=dist['H']['A']=13;
	dist['F']['G']=dist['G']['F']=dist['D']['F']=dist['H']['G']=dist['G']['H']=dist['I']['H']=dist['H']['I']=dist['I']['J']=dist['J']['I']=1;
	dist['G']['C']=dist['C']['G']=dist['D']['I']=dist['I']['D']=dist['F']['C']+1;
	dist['H']['C']=dist['C']['H']=dist['F']['C']+2;
	dist['C']['D']=dist['D']['C']=18;
	dist['C']['F']=dist['F']['C']=8;
	dist['C']['G']=dist['G']['C']=9;
	dist['C']['I']=dist['I']['C']=10;
	dist['C']['J']=dist['J']['C']=11;
	dist['C']['L']=dist['L']['C']=dist['D']['K']=dist['K']['D']=18;
	dist['D']['G']=dist['G']['D']=11;
	dist['D']['H']=dist['H']['D']=10;
	dist['D']['I']=dist['I']['D']=9;
	dist['D']['J']=dist['J']['D']=8;
	dist['F']['H']=dist['H']['F']=dist['G']['I']=dist['I']['G']=dist['H']['J']=dist['J']['H']=2;
	dist['F']['I']=dist['G']['J']=dist['J']['G']=dist['I']['F']=3;
	dist['F']['J']=dist['J']['F']=4;
	dist['K']['J']=dist['J']['K']=dist['F']['L']=dist['L']['F']=12;
	dist['G']['K']=dist['K']['G']=dist['I']['L']=dist['L']['I']=9;
	dist['G']['L']=dist['L']['G']=dist['I']['K']=dist['K']['I']=11;
	dist['H']['K']=dist['K']['H']=dist['H']['L']=dist['L']['H']=10;
	dist['K']['L']=dist['L']['K']=18;
	dist['C']['H']=dist['H']['C']=10;
	dist['F']['D']=dist['D']['F']=dist['C']['J']=dist['J']['C']=12;

	int num;
	while (n--) {
		fin >> seq;
		num=0;
		for (i=0;i<seq.length()-1;i++) {
			num+=dist[seq[i]][seq[i+1]];
		}
		fout << num << "\n";
	}

	fin.close();
	fout.close();
	return 0;
}