function solve(input) {
    let text = input.shift();
    let pattern = /(\s*@[A-Za-z]{3,}@\s*){2,}|(\s*#[A-Za-z]{3,}#\s*){2,}/g;
    let wordPattern = /[A-Za-z]{3,}/g;

    let words = text.match(pattern);
    let mirrorWords = [];

    if (words !== null) {
        for (let pair of words) {
            let arrOfPairs = pair.match(wordPattern);
            let reversedWord = arrOfPairs[1].split('').reverse().join('');

            if (reversedWord === arrOfPairs[0]) {
                mirrorWords.push(`${arrOfPairs[0]} <=> ${arrOfPairs[1]}`);
            }
        }
    }

    if (words !== null) {
        console.log(`${words.length} word pairs found!`);
    } else {
        console.log("No word pairs found!");
    }


    if (mirrorWords.length > 0) {
        console.log(`The mirror words are:`);
        console.log(mirrorWords.join(', '));
    } else {
        console.log("No mirror words!");
    }
}