#include <bitset>
#include <iostream>
#include <random>
using namespace std;

class xrand {
    uint64_t x;

   public:
    using result_type = uint32_t;
    static constexpr result_type min() {
        return numeric_limits<result_type>::min();
    }
    static constexpr result_type max() {
        return numeric_limits<result_type>::max();
    }
    xrand(uint64_t k) : x(k) {}
    xrand() : xrand(1) {}
    result_type operator()() {
        x ^= x << 9;
        x ^= x >> 7;
        return (x * 0x123456789abcdef) >> 32;
    }
};

constexpr int n = 256, len = 2048;
uint32_t a[len], b[len], c[len], a1[len], b1[len], c1[len];

xrand rng;
uniform_int_distribution<int> dist(0, n - 1), dist2(0, 1);
uniform_real_distribution<double> d1(0, 1);

int calc_score(const bitset<n> &s) {
    for (int i = 0; i < len; i++) {
        if (s[a[i]] != a1[i] and s[b[i]] != b1[i] and s[c[i]] != c1[i]) {
            return i;
        }
    }
    return len;
}

int main() {
    const clock_t start = clock();
    for (int i = 0; i < len; i++) {
        cin >> a[i] >> b[i] >> c[i] >> a1[i] >> b1[i] >> c1[i];
    }
    bitset<n> best, s;

    int best_score = calc_score(best), prev_score = best_score;
    constexpr double start_temp = 1, end_temp = 0.1;

    while (true) {
        const double phase = (clock() - start) / (1.9 * CLOCKS_PER_SEC);
        if (phase >= 1) break;
        const double temp = start_temp * pow(end_temp / start_temp, phase);

        bitset<n> locked;
        for (int i = 0; i < len; i++) {
            if (s[a[i]] == a1[i] and locked[a[i]]) continue;
            if (s[b[i]] == b1[i] and locked[b[i]]) continue;
            if (s[c[i]] == c1[i] and locked[c[i]]) continue;
            if (s[a[i]] == a1[i]) {
                locked.set(a[i]);
            } else if (s[b[i]] == b1[i]) {
                locked.set(b[i]);
            } else if (s[c[i]] == c1[i]) {
                locked.set(c[i]);
            } else if (not locked[a[i]]) {
                s.flip(a[i]);
                locked.set(a[i]);
            } else if (not locked[b[i]]) {
                s.flip(b[i]);
                locked.set(b[i]);
            } else if (not locked[c[i]]) {
                s.flip(c[i]);
                locked.set(c[i]);
            } else {
                break;
            }
        }

        for (int i = 0; i < 100; i++) {
            const int idx = dist(rng);
            s.flip(idx);
            const int score = calc_score(s);
            const double prob = exp(min(0, score - prev_score) / temp);
            if (prob < 1 and d1(rng) >= prob) {
                s.flip(idx);
            } else {
                prev_score = score;
                if (score > best_score) {
                    best_score = score;
                    best = s;
                }
            }
        }
    }
    cout << best << endl;
    return 0;
}