#include <bits/stdc++.h>
#include "abc.h"

// you may find the definitions useful
const int OP_ZERO    = 0;  // f(OP_ZERO,    x0, x1) = 0
const int OP_NOR     = 1;  // f(OP_NOR,     x0, x1) = !(x0 || x1)
const int OP_GREATER = 2;  // f(OP_GREATER, x0, x1) = (x0 > x1)
const int OP_NOT_X1  = 3;  // f(OP_NOT_X1,  x0, x1) = !x1
const int OP_LESS    = 4;  // f(OP_LESS,    x0, x1) = (x0 < x1)
const int OP_NOT_X0  = 5;  // f(OP_NOT_X0,  x0, x1) = !x0
const int OP_XOR     = 6;  // f(OP_XOR,     x0, x1) = (x0 ^ x1)
const int OP_NAND    = 7;  // f(OP_NAND,    x0, x1) = !(x0 && x1)
const int OP_AND     = 8;  // f(OP_AND,     x0, x1) = (x0 && x1)
const int OP_EQUAL   = 9;  // f(OP_EQUAL,   x0, x1) = (x0 == x1)
const int OP_X0      = 10; // f(OP_X0,      x0, x1) = x0
const int OP_GEQ     = 11; // f(OP_GEQ,     x0, x1) = (x0 >= x1)
const int OP_X1      = 12; // f(OP_X1,      x0, x1) = x1
const int OP_LEQ     = 13; // f(OP_LEQ,     x0, x1) = (x0 <= x1)
const int OP_OR      = 14; // f(OP_OR,      x0, x1) = (x0 || x1)
const int OP_ONE     = 15; // f(OP_ONE,     x0, x1) = 1


// Alice
int // returns la
alice(
    /*  in */ const int n,
    /*  in */ const char names[][5],
    /*  in */ const unsigned short numbers[],
    /* out */ bool outputs_alice[]
) {
    int la = -1;
    // for(int i = 0; i < 10; ++i) outputs_alice[++la] = n >> i & 1;
    for(int i = 0; i < n; ++i){
        int len = strlen(names[i]);
        int hsh = 0, pw = 1;
        for(int j = 0; j < len; ++j) hsh += pw * (names[i][j] - 'a' + 1), pw *= 27;
        for(int j = 0; j < 19; ++j) outputs_alice[++la] = hsh >> j & 1;
        for(int j = 0; j < 16; ++j) outputs_alice[++la] = numbers[i] >> j & 1;
    }
    // for(int i = 0; i <= la; ++i) std::cerr << outputs_alice[i];
    // std::cerr << '\n';
    return la + 1;
}


// Bob
int // returns lb
bob(
    /*  in */ const int m,
    /*  in */ const char senders[][5],
    /*  in */ const char recipients[][5],
    /* out */ bool outputs_bob[]
) {
    int lb = -1;
    // for(int i = 0; i < 10; ++i) outputs_bob[++la] = m >> i & 1;
    for(int i = 0; i < m; ++i){
        int len = strlen(senders[i]);
        int hsh = 0, pw = 1;
        for(int j = 0; j < len; ++j) hsh += pw * (senders[i][j] - 'a' + 1), pw *= 27;
        for(int j = 0; j < 19; ++j) outputs_bob[++lb] = hsh >> j & 1;
        len = strlen(recipients[i]);
        hsh = 0, pw = 1;
        for(int j = 0; j < len; ++j) hsh += pw * (recipients[i][j] - 'a' + 1), pw *= 27;
        for(int j = 0; j < 19; ++j) outputs_bob[++lb] = hsh >> j & 1;
    }
    // for(int i = 0; i <= lb; ++i) std::cerr << outputs_bob[i];
    // std::cerr << '\n';
    return lb + 1;
}


// Circuit
int // returns l
circuit(
    /*  in */ const int la,
    /*  in */ const int lb,
    /* out */ int operations[],
    /* out */ int operands[][2],
    /* out */ int outputs_circuit[][16]
) {
    // std::cerr << la << " " << lb << '\n';
    int L = la + lb - 1, n = la / 35, m = lb / 38;
    int curpos[705];
    int iseq[2][705];
    int posa[16];

    auto add = [&](int p, int x, int y){
        ++L;
        // std::cerr << L << " " << p << " " << x << " " << y << '\n';
        operations[L] = p;
        operands[L][0] = x, operands[L][1] = y;
    };

    auto chkname = [&](int x, int y){
        int st = L + 1;
        for(int i = 0; i < 19; ++i) add(OP_EQUAL, x + i, y + i);
        add(OP_ONE, 0, 1);
        for(int i = 0; i < 19; ++i) add(OP_AND, L, st + i);
        return L;
    };

    auto chkdigit = [&](int c, bool o){
        int st = L + 1;
        for(int i = 0; i < n; ++i) add(OP_AND, 35 * i + 19 + c, iseq[o][i]);
        add(OP_ZERO, 0, 1);
        for(int i = 0; i < n; ++i) add(OP_OR, L, st + i);
        return L;
    };

    auto adder_16bit = [&](int x, int y){
        // 16-bit adder
        int tpos[16];
        memset(tpos, 0, sizeof tpos);
        add(OP_ZERO, 0, 1);
        int carry = L;
        for(int i = 0; i < 16; ++i){
            add(OP_XOR, x + i, y + i);
            add(OP_XOR, L, carry);
            tpos[i] = L;
            
            int t1 = 0, t2 = 0, t3 = 0;
            add(OP_AND, x + i, y + i), t1 = L;
            add(OP_AND, x + i, carry), t2 = L;
            add(OP_AND, y + i, carry), t3 = L;
            add(OP_OR, t1, t2);
            add(OP_OR, L, t3);
            carry = L;
        }
        int ret = L + 1;
        for(int i = 0; i < 16; ++i) add(OP_X0, tpos[i], 0);
        return ret;
    };

    memset(curpos, 0, sizeof curpos);
    for(int i = 0; i < n; ++i){
        curpos[i] = L + 1;
        for(int j = 0; j < 16; ++j) add(OP_ZERO, 0, 1);
    }

    int pos[705];
    for(int i = 0; i < m; ++i){
        // for(int j = 0; j < n; ++j) std::cerr << curpos[j] << ' ';
        // std::cerr << '\n';
        int st = L + 1;
        memset(iseq, 0, sizeof iseq);
        for(int j = 0; j < n; ++j){
            iseq[0][j] = chkname(35 * j, la + 38 * i);
        }
        for(int j = 0; j < n; ++j){
            iseq[1][j] = chkname(35 * j, la + 38 * i + 19);
        }

        // std::cerr << "eq: ";
        // for(int j = 0; j < n; ++j) std::cerr << iseq[0][j] << ' ';
        // std::cerr << '\n';

        memset(posa, 0, sizeof posa);
        for(int j = 0; j < 16; ++j) posa[j] = chkdigit(j, 0);
        int npa = L + 1;
        for(int j = 0; j < 16; ++j) add(OP_X0, posa[j], 0);
        // npa: value to add
        memset(pos, 0, sizeof pos);
        for(int j = 0; j < n; ++j){
            pos[j] = L + 1;
            for(int k = 0; k < 16; ++k) add(OP_AND, npa + k, iseq[1][j]);
        }
        for(int j = 0; j < n; ++j){
            curpos[j] = adder_16bit(curpos[j], pos[j]);
        }
    }
    for(int i = 0; i < n; ++i){
        for(int j = 0; j < 16; ++j) outputs_circuit[i][j] = curpos[i] + j;
    }

    // for(int i = 0; i < n; ++i){
    //     for(int j = 0; j < 16; ++j) std::cerr << outputs_circuit[i][j] << ' ';
    //     std::cerr << '\n';
    // }

    return L + 1;
}

/*
0111000111111001000
1000100000100000000
0110000011101101000
*/