import sys


def solve_case(constraints):
    bits = [None] * 256

    for i in range(len(constraints)):
        a, b, c, p, q, r = constraints[i]
        targets = [
            (a, p),
            (b, q),
            (c, r),
        ]

        satisfied = False
        for pos, val in targets:
            if pos >= 256:
                continue
            if bits[pos] is None:
                continue
            if bits[pos] == val:
                satisfied = True
                break

        if not satisfied:
            for pos, val in targets:
                if pos >= 256:
                    continue
                if bits[pos] is None:
                    bits[pos] = val
                    satisfied = True
                    break

        if not satisfied:
            break

    return "".join(str(b if b is not None else 0) for b in reversed(bits))


def read_constraints():
    constraints = []
    N = 2048
    for _ in range(N):
        line = sys.stdin.readline()
        if not line or len(line.split()) != 6:
            break
        a, b, c, p, q, r = map(int, line.split())
        constraints.append((a, b, c, p, q, r))
    return constraints


def main():
    constraints = read_constraints()
    result = solve_case(constraints)
    print(result)


if __name__ == "__main__":
    main()