Snails have many enemies including snakes, turtles, and birds. So, snails need to communicate their travel paths using cryptography to avoid their routes being detected.

The encryption technique: The message will contain only letters. Let's assume the message length is L. We use the smallest odd integer $$$N$$$ such that $$$N \times N \ge L$$$. Then, an $$$N \times N$$$ table is used to encrypt the message as follows: Put the first letter of the message in the cell at the center of the table and then put the remaining letters in the table by moving in a circular way (snail like) around the center cell. For example, the table to the right shows the order for placing the letters from the message in a $$$7 \times 7$$$ table. So, from the center cell, we move up, then move right, then move down, then move left, then move up, etc.

Below are some sample encryptions. To help with the illustrations, when encrypting the message, if there are more cells in the table than there are letters in the message, we put the character '#' in the extra cells.

Given the size of the two-dimensional table to use and the original message, you are to encrypt the message (to help snails live longer lives).