Two chess pieces, a rook and a knight, stand on a standard chessboard 8 × 8 in size. The positions in which they are situated are known. It is guaranteed that none of them beats the other one.

Your task is to find the number of ways to place another knight on the board so that none of the three pieces on the board beat another one. A new piece can only be placed on an empty square.

Input

The first input line contains the description of the rook's position on the board. This description is a line which is 2 in length. Its first symbol is a lower-case Latin letter from a to h, and its second symbol is a number from 1 to 8. The second line contains the description of the knight's position in a similar way. It is guaranteed that their positions do not coincide.

Output

Print a single number which is the required number of ways.

Examples

Input

a1
b2


Output

44


Input

a8
d4


Output

38
import java.util.*;
import java.io.*;
import java.lang.*;
public class B38 {
	private static long mod = 1000000007;
	
	public static void main(String[] args) {
		InputReader in=new InputReader(System.in);
		PrintWriter pw=new PrintWriter(System.out);
	
	
		int[][] cb=new int[9][9];
		
		String rk=in.nextLine();
		String kn=in.nextLine();
		
		int rk_r=(int)rk.charAt(0)-'a'+1;
		int rk_c=(int)rk.charAt(1)-'0';
		int kn_r=(int)kn.charAt(0)-'a'+1;
		int kn_c=(int)kn.charAt(1)-'0';
	
		
		//pw.print(rk_c+" "+rk_r+" "+kn_c+" "+kn_r);
	
		for(int i=1;i<=8;i++) {
			cb[rk_r][i]=1;
			cb[i][rk_c]=1;
		}
	/*	for(int k=1;k<=8;k++) {
			for(int l=1;l<=8;l++)
				pw.print(cb[k][l]);
			pw.println();
		
		}
*/
		int i=rk_r;
		int j=rk_c;
		if((i+2)<=8 && (j-1)<=8 && (i+2)>=1 && (j-1)>=1)
			cb[i+2][j-1]=1;
		if((i+2)<=8 && (j+1)<=8 && (i+2)>=1 && (j+1)>=1)
			cb[i+2][j+1]=1;
		if((i-2)<=8 && (j-1)<=8 && (i-2)>=1 && (j-1)>=1)
			cb[i-2][j-1]=1;
		if((i-2)<=8 && (j+1)<=8 && (i-2)>=1 && (j+1)>=1)
			cb[i-2][j+1]=1;
		if((i+1)<=8 && (j-2)<=8 && (i+1)>=1 && (j-2)>=1)
			cb[i+1][j-2]=1;
		if((i+1)<=8 && (j+2)<=8 && (i+1)>=1 && (j+2)>=1)
			cb[i+1][j+2]=1;
		if((i-1)<=8 && (j-2)<=8 && (i-1)>=1 && (j-2)>=1)
			cb[i-1][j-2]=1;
		if((i-1)<=8 && (j+2)<=8 && (i-1)>=1 && (j+2)>=1)
			cb[i-1][j+2]=1;
		
		
		i=kn_r;
		j=kn_c;
		if((i+2)<=8 && (j-1)<=8 && (i+2)>=1 && (j-1)>=1)
			cb[i+2][j-1]=1;
		if((i+2)<=8 && (j+1)<=8 && (i+2)>=1 && (j+1)>=1)
			cb[i+2][j+1]=1;
		if((i-2)<=8 && (j-1)<=8 && (i-2)>=1 && (j-1)>=1)
			cb[i-2][j-1]=1;
		if((i-2)<=8 && (j+1)<=8 && (i-2)>=1 && (j+1)>=1)
			cb[i-2][j+1]=1;
		if((i+1)<=8 && (j-2)<=8 && (i+1)>=1 && (j-2)>=1)
			cb[i+1][j-2]=1;
		if((i+1)<=8 && (j+2)<=8 && (i+1)>=1 && (j+2)>=1)
			cb[i+1][j+2]=1;
		if((i-1)<=8 && (j-2)<=8 && (i-1)>=1 && (j-2)>=1)
			cb[i-1][j-2]=1;
		if((i-1)<=8 && (j+2)<=8 && (i-1)>=1 && (j+2)>=1)
			cb[i-1][j+2]=1;
		
		cb[kn_r][kn_c]=1;
		int count=0;
		for(int k=1;k<=8;k++) {
			for(int l=1;l<=8;l++) {
			//	pw.print(cb[k][l]);
			if(cb[k][l]==0)
				count++;
			}
		//pw.println();
		}
		
		pw.println(count);
		pw.flush();
		pw.close();
	}
	
	
	static class InputReader {
		 
		private final InputStream stream;
		private final byte[] buf = new byte[8192];
		private int curChar, snumChars;
		private SpaceCharFilter filter;
 
		public InputReader(InputStream stream) {
			this.stream = stream;
		}
 
		public int snext() {
			if (snumChars == -1)
				throw new InputMismatchException();
			if (curChar >= snumChars) {
				curChar = 0;
				try {
					snumChars = stream.read(buf);
				} catch (IOException e) {
					throw new InputMismatchException();
				}
				if (snumChars <= 0)
					return -1;
			}
			return buf[curChar++];
		}
 
		public int nextInt() {
			int c = snext();
			while (isSpaceChar(c)) {
				c = snext();
			}
			int sgn = 1;
			if (c == '-') {
				sgn = -1;
				c = snext();
			}
			int res = 0;
			do {
				if (c < '0' || c > '9')
					throw new InputMismatchException();
				res *= 10;
				res += c - '0';
				c = snext();
			} while (!isSpaceChar(c));
			return res * sgn;
		}
 
		public long nextLong() {
			int c = snext();
			while (isSpaceChar(c)) {
				c = snext();
			}
			int sgn = 1;
			if (c == '-') {
				sgn = -1;
				c = snext();
			}
			long res = 0;
			do {
				if (c < '0' || c > '9')
					throw new InputMismatchException();
				res *= 10;
				res += c - '0';
				c = snext();
			} while (!isSpaceChar(c));
			return res * sgn;
		}
 
		public int[] nextIntArray(int n) {
			int a[] = new int[n];
			for (int i = 0; i < n; i++) {
				a[i] = nextInt();
			}
			return a;
		}
		public long[] nextLongArray(int n) {
			long a[] = new long[n];
			for (int i = 0; i < n; i++) {
				a[i] = nextLong();
			}
			return a;
		}
 
		public String readString() {
			int c = snext();
			while (isSpaceChar(c)) {
				c = snext();
			}
			StringBuilder res = new StringBuilder();
			do {
				res.appendCodePoint(c);
				c = snext();
			} while (!isSpaceChar(c));
			return res.toString();
		}
 
		public String nextLine() {
			int c = snext();
			while (isSpaceChar(c))
				c = snext();
			StringBuilder res = new StringBuilder();
			do {
				res.appendCodePoint(c);
				c = snext();
			} while (!isEndOfLine(c));
			return res.toString();
		}
 
		public boolean isSpaceChar(int c) {
			if (filter != null)
				return filter.isSpaceChar(c);
			return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;
		}
 
		private boolean isEndOfLine(int c) {
			return c == '\n' || c == '\r' || c == -1;
		}
 
		public interface SpaceCharFilter {
			public boolean isSpaceChar(int ch);
		}
	}

	public static int[] suffle(int[] a,Random gen)
	{
		int n = a.length;
		for(int i=0;i<n;i++)
		{
			int ind = gen.nextInt(n-i)+i;
			int temp = a[ind];
			a[ind] = a[i];
			a[i] = temp;
		}
		return a;
	}
	
	public static void swap(int a, int b){
		int temp = a;
		a = b;
		b = temp;
	}
	
	public static ArrayList<Integer> primeFactorization(int n)
	{
		ArrayList<Integer> a =new ArrayList<Integer>();
		for(int i=2;i*i<=n;i++)
		{
			while(n%i==0)
			{
				a.add(i);
				n/=i;
			}
		}
		if(n!=1)
			a.add(n);
		return a;
	}
	
	public static void sieve(boolean[] isPrime,int n)
	{
		for(int i=1;i<n;i++)
			isPrime[i] = true;
		
		isPrime[0] = false;
		isPrime[1] = false;
		
		for(int i=2;i*i<n;i++)
		{
			if(isPrime[i] == true)
			{
				for(int j=(2*i);j<n;j+=i)
					isPrime[j] = false;
			}
		}
	}
	
	public static int GCD(int a,int b)
	{
		if(b==0)
			return a;
		else
			return GCD(b,a%b);
	}
	
	public static long GCD(long a,long b)
	{
		if(b==0)
			return a;
		else
			return GCD(b,a%b);
	}
	
	public static long LCM(long a,long b)
	{
		return (a*b)/GCD(a,b);
	}
	
	public static int LCM(int a,int b)
	{
		return (a*b)/GCD(a,b);
	}
	
	public static int binaryExponentiation(int x,int n)
	{
	    int result=1;
	    while(n>0)
	    {
	        if(n % 2 ==1)
	            result=result * x;
	        x=x*x;
	        n=n/2;
	    }
	    return result;
	}
	
	public static long binaryExponentiation(long x,long n)
	{
	    long result=1;
	    while(n>0)
	    {
	        if(n % 2 ==1)
	            result=result * x;
	        x=x*x;
	        n=n/2;
	    }
	    return result;
	}
	
	public static int modularExponentiation(int x,int n,int M)
	{
	    int result=1;
	    while(n>0)
	    {
	        if(n % 2 ==1)
	            result=(result * x)%M;
	        x=(x*x)%M;
	        n=n/2;
	    }
	    return result;
	}
	
	public static long modularExponentiation(long x,long n,long M)
	{
	    long result=1;
	    while(n>0)
	    {
	        if(n % 2 ==1)
	            result=(result * x)%M;
	        x=(x*x)%M;
	        n=n/2;
	    }
	    return result;
	}
	
	public static int modInverse(int A,int M)
	{
	    return modularExponentiation(A,M-2,M);
	}
	
	public static long modInverse(long A,long M)
	{
	    return modularExponentiation(A,M-2,M);
	}
	
	public static boolean isPrime(int n)
	{
	    
	    if (n <= 1)  return false;
	    if (n <= 3)  return true;
	    
	    if (n%2 == 0 || n%3 == 0) 
	    	return false;
	 
	    for (int i=5; i*i<=n; i=i+6)
	    {
	        if (n%i == 0 || n%(i+2) == 0)
	           return false;
	    }
	    
	    return true;
	}
	
	static class pair implements Comparable<pair>
	{
		Integer x, y;
		pair(int x,int y)
		{
			this.x=x;
			this.y=y;
		}
		
		public int compareTo(pair o) {
			int result = x.compareTo(o.x);
			if(result==0)
				result = y.compareTo(o.y);
			
			return result;
		}  
	}
}

		