1906A.cpp

#include <bits/stdc++.h>
using namespace std;

vector<pair<int, int>> directions = {
    {-1, -1}, {-1, 0}, {-1, 1},
    {0, -1},          {0, 1},
    {1, -1},  {1, 0}, {1, 1}
};


vector<pair<char, pair<int, int>>> getNeighbors(
    char grid[3][3], int row, int col,
    pair<int, int> exclude1 = {-1, -1},
    pair<int, int> exclude2 = {-1, -1}
) {
    vector<pair<char, pair<int, int>>> result;
    for (auto [dx, dy] : directions) {
        int newRow = row + dx;
        int newCol = col + dy;
        pair<int, int> current = {newRow, newCol};
        if (newRow >= 0 && newRow < 3 && newCol >= 0 && newCol < 3) {
            if (current != exclude1 && current != exclude2) {
                result.push_back({grid[newRow][newCol], current});
            }
        }
    }
    sort(result.begin(), result.end()); 

    return result;
}

int main() {
    char grid[3][3];
    vector<pair<int, int>> allPositions;
    char smallest = 'Z';


    for (int i = 0; i < 3; i++) {
        string temp;
        cin >> temp;
        for (int j = 0; j < 3; j++) {
            grid[i][j] = temp[j];
            if (grid[i][j] < smallest) {
                smallest = grid[i][j];
                allPositions.clear();
                allPositions.push_back({i, j});
            } else if (grid[i][j] == smallest) {
                allPositions.push_back({i, j});
            }
        }
    }

    string result = "ZZZ";

    
    for (auto smallestPos : allPositions) {
        auto level1 = getNeighbors(grid, smallestPos.first, smallestPos.second, smallestPos);

        for (auto &[char2, pos2] : level1) {
            auto level2 = getNeighbors(grid, pos2.first, pos2.second, smallestPos, pos2);

            for (auto &[char3, pos3] : level2) {
                string temp = "";
                temp += grid[smallestPos.first][smallestPos.second];
                temp += char2;
                temp += char3;

                if (temp < result) {
                    result = temp;
                }
            }
        }
    }

    cout << result << endl;
    return 0;
}