The only king stands on the standard chess board. You are given his position in format "cd", where c is the column from 'a' to 'h' and d is the row from '1' to '8'. Find the number of moves permitted for the king.

Check the king's moves here https://en.wikipedia.org/wiki/King_(chess).

<image> King moves from the position e4

Input

The only line contains the king's position in the format "cd", where 'c' is the column from 'a' to 'h' and 'd' is the row from '1' to '8'.

Output

Print the only integer x — the number of moves permitted for the king.

Example

Input

e4


Output

8
/*
 * To change this license header, choose License Headers in Project Properties.
 * To change this template file, choose Tools | Templates
 * and open the template in the editor.
 */
/**
 *
 * @author ssaxena36 FI/O from @uwi
 */
import java.io.*;
import java.math.BigInteger;
import java.util.*;
public class TesttClass
{
   static ArrayList<Integer>list=new ArrayList<>();
   void solution()
    {
        //TesttClass oj=new TesttClass();
    //   oj.SieveOfEratosthenes(101000);
        // System.out.print(list);
        String s=inps();
       char ch=s.charAt(0);
       int num=Integer.parseInt(s.substring(1));
      // out.println(ch+" "+num);
       if(ch>='b' && ch<='g')
       {
           if(num>=2 && num<=7)
           {
               out.println("8");
           }
           if(num==8 || num==1)
           {
               out.println("5");
           }
       }
       else if(ch=='a' || ch=='h')
       {
           if(num==1 || num==8)
           {
               out.println("3");
           }
           else
           {
               out.println("5");
           }
       }
    }
   public void SieveOfEratosthenes(int n)
{
    boolean prime[]=new boolean[n+1]; 
    Arrays.fill(prime, true);
    for (int p=2; p*p<=n; p++)
    {
        if (prime[p] == true)
        {
            for (int i=p*2; i<=n; i += p)
                prime[i] = false;
        }
    }
    // Print all prime numbers
    for (int p=2; p<=n; p++)
    { if (prime[p])
    {
      //  System.out.print(p+" ");
        list.add(p);
    }
}
   // return list;
}
    
    InputStream obj;
    PrintWriter out;
    String check="";
    public static void main(String[] args)throws IOException{
        new TesttClass().main1();
    }
    void main1()throws IOException{
        out=new PrintWriter(System.out);
        obj=check.isEmpty() ? System.in : new ByteArrayInputStream(check.getBytes());
       solution();
        out.flush();
        out.close();
    }
    byte inbuffer[]=new byte[1024];
    int lenbuffer=0,ptrbuffer=0;
    int readByte(){
        if(lenbuffer==-1)
            throw new InputMismatchException();
        if(ptrbuffer>=lenbuffer)
        {
            ptrbuffer=0;
            try {
                lenbuffer=obj.read(inbuffer);
            } catch (IOException e) {
                throw new InputMismatchException();
            }
        }
        if(lenbuffer<=0)
            return -1;
        return inbuffer[ptrbuffer++];
    }
    boolean isSpaceChar(int c)
    {
        return (!(c>=33 && c<=126));
    }
    int skip()
    {
        int b;
        while((b=readByte())!=-1 && isSpaceChar(b));
        return b;
    }
    String inps()
    {
        int b=skip();
        StringBuilder sb=new StringBuilder();
        while(!(isSpaceChar(b)))
        {
            sb.appendCodePoint(b);
            b=readByte();
        }
        return sb.toString();
    }
    int inpi()
    {
        int num = 0, b;
        boolean minus = false;
        while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));
        if(b == '-')
        {
            minus = true;
            b = readByte();
        }
        while(true)
        {
            if(b >= '0' && b <= '9')
            {
                num = num * 10 + (b - '0');
            }
            else
            {
                return minus ? -num : num;
            }
            b = readByte();
        }
    }
    long inpl()
    {
        long num = 0;
        int b;
        boolean minus = false;
        while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));
        if(b == '-')
        {
            minus = true;
            b = readByte();
        }
        while(true)
        {
            if(b >= '0' && b <= '9')
            {
                num = num * 10 + (b - '0');
            }
            else
            {
                return minus ? -num : num;
            }
            b = readByte();
        }
    }
    float inpf()
    {
        return Float.parseFloat(inps());
    }
    double inpd()
    {
        return Double.parseDouble(inps());
    }
    char inpc()
    {
        return (char)skip();
    }
    int[] inpia(int n)
    {
        int a[]=new int[n];
        for(int i=0;i<n;i++)
            a[i]=inpi();
        return a;
    }
    long[] inpla(int n)
    {
        long a[]=new long[n];
        for(int i=0;i<n;i++)
            a[i]=inpl();
        return a;
    }
    String[] inpsa(int n)
    {
        String a[]=new String[n];
        for(int i=0;i<n;i++)
            a[i]=inps();
        return a;
    }
    double[][] inpdm(int n, int m)
    {
        double a[][]=new double[n][m];
        for(int i=0;i<n;i++)
            for(int j=0;j<m;j++)
                a[i][j]=inpd();
        return a;
    }
    int[][] inpim(int n, int m)
    {
        int a[][]=new int[n][m];
        for(int i=0;i<n;i++)
            for(int j=0;j<m;j++)
                a[i][j]=inpi();
        return a;
    }
}