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

using namespace std;

typedef uint8_t ResultCode;

struct Guess {
    int d[5];
    int mask;
};

// ヒット・ブロー判定の高速化
inline ResultCode get_hb_code(const Guess& q, const Guess& t) {
    int h = 0;
    if (q.d[0] == t.d[0]) h++;
    if (q.d[1] == t.d[1]) h++;
    if (q.d[2] == t.d[2]) h++;
    if (q.d[3] == t.d[3]) h++;
    if (q.d[4] == t.d[4]) h++;
    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);

    auto start_time = chrono::steady_clock::now();
    auto get_elapsed = [&]() {
        return chrono::duration_cast<chrono::milliseconds>(chrono::steady_clock::now() - start_time).count();
    };

    mt19937 rng(42);
    vector<Guess> all_patterns;
    for (int i = 0; i <= 99999; i++) {
        int tmp = i, m = 0, 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 = m;
            for (int j = 0; j < 5; j++) g.d[j] = digs[j];
            all_patterns.push_back(g);
        }
    }

    vector<int> candidates;
    for (int i = 0; i < (int)all_patterns.size(); i++) candidates.push_back(i);
    
    vector<bool> is_solved(all_patterns.size(), false);
    vector<int> solved_indices;
    int solved_count = 0;

    double log_table[30241];
    for (int i = 0; i <= 30240; i++) log_table[i] = (i <= 1) ? 0 : log2((double)i);

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

        // 1. 探索フェーズ（5秒の制限時間を考慮）
        if (candidates.size() <= (size_t)(30 - solved_count)) {
            for (int c : candidates) if (!is_solved[c]) { best_guess_idx = c; break; }
        } else if (solved_count == 0 && candidates.size() == 30240) {
            best_guess_idx = 0; // "01234" (all_patternsの並び順に依存)
            for(int i=0; i<(int)all_patterns.size(); ++i) {
                if(all_patterns[i].d[0]==0 && all_patterns[i].d[1]==1 && all_patterns[i].d[2]==2) {
                    best_guess_idx = i; break;
                }
            }
        } else {
            double max_entropy = -1.0;
            // 残り時間を確認し、1クエリに使える時間を配分（後半ほど短く）
            long long time_limit = 4700; // 4.7秒まで攻める
            
            int sample_size = (candidates.size() < 1000) ? candidates.size() : 600;
            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()]);
            }

            // 時間が許す限りループ
            int attempts = 0;
            while (get_elapsed() < time_limit) {
                attempts++;
                int q_idx = (rng() % 10 < 8) ? 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])]++;

                double entropy = 0;
                for (int j = 0; j < 36; j++) if (counts[j] > 0) entropy -= (double)counts[j] * log_table[counts[j]];

                if (entropy > max_entropy) {
                    max_entropy = entropy;
                    best_guess_idx = q_idx;
                }
                // 候補が少ない時は早めに切り上げ
                if (candidates.size() < 100 && attempts > 2000) break;
                // 最初の方は時間を多めに使う
                if (attempts > 5000) break; 
            }
        }

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

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

        // 3. レスポンス取得
        int res_freq[36] = {0};
        for (int i = 0; i < 30; i++) {
            int h, b; cin >> h >> b;
            if (h == -1) return 0;
            res_freq[h * 6 + b]++;
        }

        // 4. 解決状況更新
        if (!is_solved[best_guess_idx] && res_freq[30] > (int)solved_indices.size()) {
            is_solved[best_guess_idx] = true;
            solved_indices.push_back(best_guess_idx);
        }
        solved_count = res_freq[30];
        if (solved_count == 30) break;

        // 5. 度数分布（ヒストグラム）を用いた厳密フィルタリング
        int unknown_res_freq[36];
        for (int j = 0; j < 36; j++) unknown_res_freq[j] = res_freq[j];
        // 既に特定済みの30個が(5,0)として返ってきている分を引く
        unknown_res_freq[30] -= (int)solved_indices.size();

        vector<int> next_candidates;
        next_candidates.reserve(candidates.size());
        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]);
            // 未知のターゲット群が生成したHB結果の中に、この候補のHB結果が含まれているか
            if (unknown_res_freq[code] > 0) {
                next_candidates.push_back(c_idx);
            }
        }
        candidates = move(next_candidates);
    }

    return 0;
}