Mirror Numbers

/* You are given n 4-digit numbers. Write a program to find among these numbers all pairs of mirror numbers, such that the reversed positions of digits in the first number are equal to the positions of digits of the second number. Note that both numbers should be distinct (a ≠ b). Put the sign “<!>” between the numbers.
 * The first line holds the count n. The next line holds n 4-digit integer numbers, separated by a space. The input numbers will be distinct (no duplicates are allowed).
 * Print at the console all mirror numbers {a, b} found in the input sequence in format "a<!>b" (without any spaces), each at a separate line. The order of the output lines is not important. Print "No" in case no stuck numbers exist among the input sequence of numbers. */

namespace Mirror_Numbers
{
    using System;
    using System.Linq;

    class MirrorNumbers
    {
        static void Main(string[] args)
        {
            int n = int.Parse(Console.ReadLine());
            int[] numbers = Console.ReadLine().Split(new char[] { ' ', '\t' }, StringSplitOptions.RemoveEmptyEntries).Select(int.Parse).ToArray();

            bool isFoundMirror = false;
            for (int i = 0; i < numbers.Length; i++)
            {
                for (int j = 0; j < numbers.Length; j++)
                {
                    if (j == i) continue;

                    string strA = numbers[i].ToString();
                    string strB = numbers[j].ToString();
                    if (strA.Length != strB.Length || strA.Length != 4 ||
                        strA[0] != strB[3] || strA[1] != strB[2] ||
                        strA[2] != strB[1] || strA[3] != strB[0]) continue;

                    isFoundMirror = true;
                    Console.WriteLine("{0}<!>{1}", strA, strB);
                    numbers[i] = 0;
                    numbers[j] = 0;
                }
            }

            if (!isFoundMirror)
            {
                Console.WriteLine("No");
            }
        }
    }
}