//坏的电子时钟
#include <iostream>
#include <vector>
#include <string>
#include <bitset>
#include <iomanip>
#include <sstream>

using namespace std;

// 7段显示器的数字0-9的段表示，使用7位二进制数表示每个段的开/关状态
const int DIGIT_SEGMENTS[10] = {
    0b1111110, // 0
    0b0110000, // 1
    0b1101101, // 2
    0b1111001, // 3
    0b0110011, // 4
    0b1011011, // 5
    0b1011111, // 6
    0b1110000, // 7
    0b1111111, // 8
    0b1111011  // 9
};

// 将时间字符串 "HH:MM" 转换为4个7段表示
vector<int> timeToSegments(const string& time) {
    int hours = stoi(time.substr(0, 2));
    int minutes = stoi(time.substr(3, 2));
    return { DIGIT_SEGMENTS[hours / 10], DIGIT_SEGMENTS[hours % 10],
            DIGIT_SEGMENTS[minutes / 10], DIGIT_SEGMENTS[minutes % 10] };
}

// 检查观察到的段模式是否可以与目标段模式匹配
bool isPatternConsistent(const vector<int>& observed, const vector<int>& target) {
    for (int i = 0; i < 4; ++i) {
        if ((observed[i] & target[i]) != observed[i]) {  // 观察到的段必须是目标段的子集
            return false;
        }
    }
    return true;
}

// 生成所有可能的初始时间
vector<string> generatePossibleTimes(int N, const vector<string>& observedPatterns) {
    vector<string> results;

    for (int h = 0; h < 24; ++h) {
        for (int m = 0; m < 60; ++m) {
            bool possible = true;
            vector<string> timesSequence;

            int hours = h;
            int minutes = m;

            for (int minute = 0; minute < N; ++minute) {
                ostringstream oss;
                oss << setw(2) << setfill('0') << hours << ":"
                    << setw(2) << setfill('0') << minutes;
                string timeStr = oss.str();

                //cout << timeStr << endl;

                vector<int> expectedSegments = timeToSegments(timeStr);
                vector<int> observedSegments = timeToSegments(observedPatterns[minute]);

                if (!isPatternConsistent(observedSegments, expectedSegments)) {
                    possible = false;
                    break;
                }

                timesSequence.push_back(timeStr);

                // 增加1分钟
                minutes++;
                if (minutes == 60) {
                    minutes = 0;
                    hours = (hours + 1) % 24;
                }
            }

            if (possible) {
                results.push_back(timesSequence[0]);
            }
        }
    }

    return results;
}

int main() {
   /* vector<pair<int, vector<string>>> cases = {
        {1, {"88:88"}},
        {2, {"23:25", "23:26"}},
        {3, {"71:57", "71:57", "71:07"}}
    };*/
    vector<pair<int, vector<string>>> cases;
    int cnt = 0, n;
    while (cin>>n)
    {
        string bin;
        vector<string> pattern;
        for (int i = 0; i < n; i++)
        {
            cin >> bin;
            pattern.push_back(bin);
        }
        cases.push_back(make_pair(n, pattern));
        
        int N = cases[cnt].first;
        const vector<string>& patterns = cases[cnt].second;

        vector<string> possibleTimes = generatePossibleTimes(N, patterns);

        if (possibleTimes.empty()) {
            cout << "none" << endl;
        }
        else {
            for (size_t i = 0; i < possibleTimes.size(); ++i) {
                if (i > 0) cout << " ";
                cout << possibleTimes[i];
            }
            cout << endl;
        }
        cnt++;

    }
 /*   for (const auto& caseItem : cases) {
       
    }*/

    

    return 0;
}