using System;

​

public class Eggcelent

{

    public static void Main()

    {

        //input

        int n = int.Parse(Console.ReadLine());

        int height = 2 * n;

        int width = (3 * n) + 1;

        int widthEgg = (3 * n) - 1;

        int[,] matrix = new int[height, width];

​

        //solution

        int curCol = 1;

        int curRow = n / 2;

        while (true)

        {

            matrix[curRow, curCol] = 1;

            curCol += 2;

            curRow--;

            if (curRow < 0)

            {

                curCol--;

                curRow++;

                break;

            }

        }

        for (int i = 0; i < n - 2; i++)

        {

            matrix[curRow, curCol] = 1;

            curCol++; 

        }

        curCol--;

        while (true)

        {

            matrix[curRow, curCol] = 1;

            curCol += 2;

            curRow++;

            if (curCol > widthEgg )

            {

                curCol -= 2;

                curRow--;

                break;

            }

        }

        for (int j = 0; j < n ; j++)

        {

            matrix[curRow, curCol] = 1;

            curRow++;

        }

        curRow--;

        while (true)

        {

            matrix[curRow, curCol] = 1;

            curCol -= 2;

            curRow++;

            if (curRow == height)

            {

                curCol += 2;

                curRow--;

                break;

            }

        }

​

        for (int k = 0; k < n - 1; k++)

        {

            matrix[curRow, curCol] = 1;

            curCol--;

        }

        curCol++;

        while (true)

        {

            matrix[curRow, curCol] = 1;

            curCol -= 2;

            curRow--;

            if (curCol < 0)

            {

                curCol += 2;

                curRow++;

                break;

            }

        }

        for (int l = 0; l < n; l++)

        {

            matrix[curRow, curCol] = 1;

            curRow--;

        }

        curRow = n - 1;

        curCol = 2;

        for (int o = 0; o < widthEgg - 2; o++)

        {

            if (curCol % 2 == 0)

            {

                matrix[curRow, curCol] = 2;

            }

            curCol++;

        }

        curRow = n;

        curCol = 2;

        for (int p = 0; p < widthEgg - 2; p++)

        {

            if (curCol % 2 != 0)

            {

                matrix[curRow, curCol] = 2;

            }

            curCol++;

        }

        //output

        for (int col = 0; col < height; col++)

        {

            for (int row = 0; row < width; row++)

            {

                if (matrix[col, row] == 1)

                {

                    Console.Write("*");

                }

                else if (matrix[col, row] == 2)

                {

                    Console.Write("@");

                }

                else

                {

                    Console.Write(".");

                }

            }

            Console.WriteLine();

        }

    }

}

​

​