using System;

public class Program

{

    public static void Main()

    {

        //Console.WriteLine(Char.ConvertToUtf32("a", 0));

        //Console.WriteLine(Char.ConvertToUtf32("h", 0));

        //Console.WriteLine(Char.ConvertToUtf32("h", 0) - Char.ConvertToUtf32("a", 0));

        Console.WriteLine(chessKnight("d5"));

    }

    public static int chessKnight(string cell) {

        int count= 0;

        int[] c = new int[2]; 

        c[0] = Char.ConvertToUtf32(cell, 0) - 96;

        char[] b = cell.ToCharArray();

        string x = b[1].ToString();

        if (Int32.TryParse(x, out c[1]))

        {

            // you know that the parsing attempt

            // was successful

        }

        Console.WriteLine(c[1] - 1);

        //left side

        //horizontal 2, vert 1

        if((c[0] - 2) >= 1 && (c[1] - 1) >= 1)

        {count++; Console.WriteLine("Left side: {0},{1}", (c[0] - 2), (c[1] - 1));}

        if((c[0] - 2) >= 1 && (c[1] + 1) <= 8)

        {count++; Console.WriteLine("Left side: {0},{1}", (c[0] - 2), (c[1] + 1));}

        //horizontal 1, vert 2

        if((c[0] - 1) >= 1 && (c[1] - 2) >= 1)

        {count++; Console.WriteLine("Left side: {0},{1}", (c[0] - 1), (c[1] - 2));}

        if((c[0] - 1) >= 1 && (c[1] + 2) <= 8)

        {count++; Console.WriteLine("Left side: {0},{1}", (c[0] - 1), (c[1] + 2));}

        //right side

        if((c[0] + 2) <= 8 && (c[1] - 1) >= 1)

        {count++; Console.WriteLine("Right side: {0},{1}", (c[0] + 2), (c[1] - 1));}

        if((c[0] + 2) <= 8 && (c[1] + 1) <= 8)

        {count++; Console.WriteLine("Right side: {0},{1}", (c[0] + 2), (c[1] + 1));}

        if((c[0] + 1) <= 8 && (c[1] - 2) >= 1)

        {count++; Console.WriteLine("Right side: {0},{1}", (c[0] + 1), (c[1] - 2));}

        if((c[0] + 1) <= 8 && (c[1] + 2) <= 8)

        {count++; Console.WriteLine("Right side: {0},{1}", (c[0] + 1), (c[1] + 2));}

        return count;

    }

    //if (cell[0] - 2) >= 1 && (cell[1] +/- 1) >= 1

    //if (cell[0] - 1) > 1 && (cell[1] - 2) > 1

}