05.01.Programmer DNA - мое решение

using System;
class ProgrammerDNA
{
    static void Main()
    {
        int N = int.Parse(Console.ReadLine());
        char letter = char.Parse(Console.ReadLine());
        int row = 7;

        while (N > 0)
        {
            letter = FindDNS(row,letter);
            if (N - 7 < 7)
            {
                row = N - row;
                N = row;
            }
            else
            {
                N -= row;
            }
        }
    }

    private static char FindDNS(int row, char letter)
    {
        //int dots = 3,
        int downDots = 0, downLetter = 7;
        for (int i = 0; i < row; i++)
        {
            if (i < 7 / 2)
            {
                Console.Write(new string('.', (7 / 2) - i));//тук може да е dots
                for (int j = 0; j < i + i + 1; j++)
                {
                    Console.Write(letter);
                    if (letter == 'G')
                    {
                        letter = 'A';
                    }
                    else
                    {
                        letter++;
                    }
                }
                Console.Write(new string('.', (7 / 2) - i));
                Console.WriteLine();
                //dots++;
            }
            else
            {
                Console.Write(new string('.', downDots));
                for (int g = 0; g < downLetter; g++)
                {
                    Console.Write(letter);
                    if (letter == 'G')
                    {
                        letter = 'A';
                    }
                    else
                    {
                        letter++;
                    }
                }
                Console.Write(new string('.', downDots));
                Console.WriteLine();
                downLetter -= 2;
                downDots += 1;
            }
        }
        return letter;
    }
}