#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vc;
typedef vector<vector<int>> matrix;
#define sp ' '
#define ft(n) for(int i=1; i<=n; i++)
string file = "bool";
ifstream f(file + ".in");
ofstream g(file + ".out");
int p, n; //string pos
string s;
map<char, int> m;
int expression(const string& s, int& p);
int term(const string& s, int& p);
int factor(const string& s, int& p);
int number(const string& s, int& p);
int expression(const string& s, int& p)
{
int res = term(s, p);
while (p < s.size() && s[p] == '|')
{
p++;
res = (res | term(s, p));
}
return res;
}
int term(const string& s, int& p)
{
int res = factor(s, p);
while (p < s.size() && s[p] == '&')
{
p++;
int fc = factor(s, p);
res = (res & fc);
}
return res;
}
int factor(const string& s, int& p)
{
int fl = 0;
if (s[p] == '!')
{
fl = 1;
p++;
}
if (s[p] == '(')
{
p++;
int res = expression(s, p);
p++;
return (fl ^ res);
}
else
return (fl ^ number(s, p));
}
int number(const string& s, int& p)
{
int res = 0;
if (isupper(s[p]))
{
res = m[s[p]];
}
if (s[p] == '1')
{
res = 1;
}
if (s[p] == '0')
{
res = 0;
}
p++;
return res;
}
void input()
{
string inp;
getline(f, inp);
char c = 0, letter = 0;
for (int i = 0; i <= inp.size(); i++)
{
c = inp[i];
//g << c << endl;
if (isupper(c))
{
if (letter == 0)
{
letter = c;
}
else
{
if (letter == 'A' && c == 'N')
{
s.push_back('&');
}
if (letter == 'O' && c == 'R')
{
s.push_back('|');
}
if (letter == 'T' && c == 'R')
{
s.push_back('1');
}
if (letter == 'F' && c == 'A')
{
s.push_back('0');
}
if (letter == 'N' && c == 'O')
{
s.push_back('!');
}
letter = 0;
while (isupper(inp[i]))
{
i++;
}
i--;
}
}
if (c == ' ')
{
if (letter != 0)
{
s.push_back(letter);
letter = 0;
}
}
if (c == '(')
{
if (letter != 0)
{
s.push_back(letter);
letter = 0;
}
s.push_back('(');
}
if (c == ')')
{
if (letter != 0)
{
s.push_back(letter);
letter = 0;
}
s.push_back(')');
}
}
}
int main()
{
input();
f >> n;
//g << s << endl;
for (int i = 'A'; i <= 'Z'; i++)
{
m[char(i)] = 0;
}
for (int i = 1; i <= n; i++)
{
char c;
f >> c;
m[c] = 1 - m[c];
p = 0;
g << expression(s, p);
}
return 0;
}