#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <random>
#include <chrono>

using namespace std;

typedef uint8_t ResultCode;

// 構造体を16バイトにアラインメントし、キャッシュ効率を最大化
struct alignas(16) Guess {
    uint32_t packed; 
    uint16_t mask;
    uint8_t d[5];
    int id;
};

// 条件分岐を排除したヒット判定
inline ResultCode get_hb_code(const Guess& q, const Guess& t) {
    uint32_t diff = q.packed ^ t.packed;
    // 各桁(4bit)が一致すれば0になる。0の桁をビット演算でカウント。
    // (val - 0x11111) & ~val & 0x11111 的な手法より、このケースでは単純な比較が速いことが多い
    int h = ( (diff & 0xF0000u) == 0 ) + 
            ( (diff & 0x0F000u) == 0 ) + 
            ( (diff & 0x00F00u) == 0 ) + 
            ( (diff & 0x000F0u) == 0 ) + 
            ( (diff & 0x0000Fu) == 0 );

    int common = __builtin_popcount(q.mask & t.mask);
    return (ResultCode)(h * 6 + (common - h));
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);

    mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

    vector<Guess> all_patterns;
    all_patterns.reserve(30240);
    int first_guess_idx = -1;

    for (int i = 0; i <= 98765; i++) {
        int tmp = i, m = 0;
        uint8_t digs[5];
        bool ok = true;
        for (int j = 4; j >= 0; j--) {
            digs[j] = tmp % 10;
            if (m & (1 << digs[j])) { ok = false; break; }
            m |= (1 << digs[j]);
            tmp /= 10;
        }
        if (ok) {
            Guess g;
            g.mask = (uint16_t)m;
            g.id = (int)all_patterns.size();
            g.packed = 0;
            for (int j = 0; j < 5; j++) {
                g.d[j] = digs[j];
                g.packed = (g.packed << 4) | digs[j];
            }
            if (i == 1234) first_guess_idx = g.id; // "01234"
            all_patterns.push_back(g);
        }
    }

    vector<int> candidates;
    candidates.reserve(30240);
    for (int i = 0; i < (int)all_patterns.size(); i++) candidates.push_back(i);

    vector<bool> is_solved(all_patterns.size(), false);
    vector<bool> is_candidate(all_patterns.size(), true);
    int solved_count = 0;

    // 5.0sあるため、計算精度を上げるためにスケールを大きくしたスコアテーブル
    static int64_t score_table[30241];
    for (int i = 0; i <= 30240; i++) {
        score_table[i] = (i <= 1) ? 0 : (int64_t)(i * log2(i) * 10000);
    }

    while (solved_count < 30) {
        int best_guess_idx = -1;

        if (candidates.size() <= (size_t)(30 - solved_count) && !candidates.empty()) {
            for (int c : candidates) {
                if (!is_solved[c]) { best_guess_idx = c; break; }
            }
        } else if (solved_count == 0 && candidates.size() == 30240) {
            best_guess_idx = first_guess_idx;
        } else {
            int64_t min_score = 0x7FFFFFFFFFFFFFFFLL;
            
            // 5.0秒制限に合わせて探索数を増加 (合計試行回数を約3~5倍に)
            int turn_limit = (candidates.size() > 2000) ? 1500 : 3000;
            int sample_size = min((int)candidates.size(), (candidates.size() > 1000) ? 1200 : (int)candidates.size());
            
            vector<int> samples;
            if (candidates.size() <= (size_t)sample_size) {
                samples = candidates;
            } else {
                for (int i = 0; i < sample_size; i++) 
                    samples.push_back(candidates[rng() % candidates.size()]);
            }

            for (int i = 0; i < turn_limit; i++) {
                // 候補から選ぶ戦略を重視(85%)
                int q_idx = (rng() % 100 < 85) ? candidates[rng() % candidates.size()] : rng() % all_patterns.size();
                if (is_solved[q_idx]) continue;

                int counts[36] = {0};
                for (int s_idx : samples) {
                    counts[get_hb_code(all_patterns[q_idx], all_patterns[s_idx])]++;
                }

                int64_t current_score = 0;
                for (int j = 0; j < 36; j++) current_score += score_table[counts[j]];
                
                // 候補内からの推測には強力なボーナス（期待値が同等なら直接撃ち抜く）
                if (is_candidate[q_idx]) current_score -= 500; 

                if (current_score < min_score) {
                    min_score = current_score;
                    best_guess_idx = q_idx;
                }
            }
        }

        if (best_guess_idx == -1) best_guess_idx = candidates[0];

        // 出力
        for (int i = 0; i < 5; i++) cout << (int)all_patterns[best_guess_idx].d[i];
        cout << endl;

        // 受信
        int current_res_freq[36] = {0};
        for (int i = 0; i < 30; i++) {
            int h, b;
            if (!(cin >> h >> b)) return 0;
            if (h == -1) return 0;
            current_res_freq[h * 6 + b]++;
        }

        if (!is_solved[best_guess_idx] && current_res_freq[30] > solved_count) {
            is_solved[best_guess_idx] = true;
        }
        solved_count = current_res_freq[30];
        if (solved_count == 30) break;

        // フィルタリング
        vector<int> next_candidates;
        fill(is_candidate.begin(), is_candidate.end(), false);
        for (int c_idx : candidates) {
            if (is_solved[c_idx]) continue;
            ResultCode code = get_hb_code(all_patterns[best_guess_idx], all_patterns[c_idx]);
            if (code < 30 && current_res_freq[code] > 0) {
                next_candidates.push_back(c_idx);
                is_candidate[c_idx] = true;
            }
        }
        candidates = move(next_candidates);
    }

    return 0;
}