#include <bits/stdc++.h>
// #include <windows.h>
// #include <bits/extc++.h>
// using namespace __gnu_pbds;
using namespace std;
//#pragma GCC optimize(3)
#define DB double
#define LL long long
#define ULL unsigned long long
#define in128 __int128
#define cint const int
#define cLL const LL
#define For(z,e1,e2) for(int z=(e1);z<=(e2);z++)
#define Rof(z,e1,e2) for(int z=(e2);z>=(e1);z--)
#define For_(z,e1,e2) for(int z=(e1);z<(e2);z++)
#define Rof_(z,e1,e2) for(int z=(e2);z>(e1);z--)
#define inint(e) scanf("%d",&e)
#define inll(e) scanf("%lld",&e)
#define inpr(e1,e2) scanf("%d%d",&e1,&e2)
#define in3(e1,e2,e3) scanf("%d%d%d",&e1,&e2,&e3)
#define outint(e) printf("%d\n",e)
#define outint_(e) printf("%d%c",e," \n"[i==n])
#define outint2_(e,e1,e2) printf("%d%c",e," \n"[(e1)==(e2)])
#define outll(e) printf("%lld\n",e)
#define outll_(e) printf("%lld%c",e," \n"[i==n])
#define outll2_(e,e1,e2) printf("%lld%c",e," \n"[(e1)==(e2)])
#define exc(e) if(e) continue
#define stop(e) if(e) break
#define ret(e) if(e) return
#define ll(e) (1ll*(e))
#define pb push_back
#define ft first
#define sc second
#define pii pair<int,int>
#define pli pair<long long,int>
#define vct vector
#define clean(e) while(!e.empty()) e.pop()
#define all(ev) ev.begin(),ev.end()
#define sz(ev) ((int)ev.size())
#define debug(x) printf("%s=%d\n",#x,x)
#define x0 __xx00__
#define y1 __yy11__
#define ffo fflush(stdout)
cLL mod=998244353,G=404;
// cLL mod[2]={1686688681ll,1666888681ll},base[2]={166686661ll,188868881ll};
template <typename Type> void get_min(Type &w1,const Type w2) { if(w2<w1) w1=w2; } template <typename Type> void get_max(Type &w1,const Type w2) { if(w2>w1) w1=w2; }
template <typename Type> Type up_div(Type w1,Type w2) { return (w1/w2+(w1%w2?1:0)); }
template <typename Type> Type gcd(Type X_,Type Y_) { Type R_=X_%Y_; while(R_) { X_=Y_; Y_=R_; R_=X_%Y_; } return Y_; } template <typename Type> Type lcm(Type X_,Type Y_) { return (X_/gcd(X_,Y_)*Y_); }
template <typename Type> Type md(Type w1,const Type w2=mod) { w1%=w2; if(w1<0) w1+=w2; return w1; } template <typename Type> Type md_(Type w1,const Type w2=mod) { w1%=w2; if(w1<=0) w1+=w2; return w1; }
void ex_gcd(LL &X_,LL &Y_,LL A_,LL B_) { if(!B_) { X_=1ll; Y_=0ll; return ; } ex_gcd(Y_,X_,B_,A_%B_); X_=md(X_,B_); Y_=(1ll-X_*A_)/B_; } LL inv(LL A_,LL B_=mod) { LL X_=0ll,Y_=0ll; ex_gcd(X_,Y_,A_,B_); return X_; }
template <typename Type> void add(Type &w1,const Type w2,const Type M_=mod) { w1=md(w1+w2,M_); } void mul(LL &w1,cLL w2,cLL M_=mod) { w1=md(w1*md(w2,M_),M_); } template <typename Type> Type pw(Type X_,Type Y_,Type M_=mod) { Type S_=1; while(Y_) { if(Y_&1) mul(S_,X_,M_); Y_>>=1; mul(X_,X_,M_); } return S_; }
template <typename Type> Type bk(vector <Type> &V_) { auto T_=V_.back(); V_.pop_back(); return T_; } template <typename Type> Type tp(stack <Type> &V_) { auto T_=V_.top(); V_.pop(); return T_; } template <typename Type> Type frt(queue <Type> &V_) { auto T_=V_.front(); V_.pop(); return T_; }
template <typename Type> Type bg(set <Type> &V_) { auto T_=*V_.begin(); V_.erase(V_.begin()); return T_; } template <typename Type> Type bk(set <Type> &V_) { auto T_=*prev(V_.end()); V_.erase(*prev(V_.end())); return T_; }
mt19937 gen(time(NULL)); int rd() { return abs((int)gen()); }
int rnd(int l,int r) { return rd()%(r-l+1)+l; }
void main_init()
{

}
cint N=10,P=1<<N|11,L=1.02e6,Q_=2.01e5;
int n,p;
char str[L];
const char ch[]={'=','&','|','^'};
const int f[4][2][2]={{{1,0},{0,1}},{{0,0},{0,1}},{{0,1},{1,1}},{{0,1},{1,0}}};
const char ch2[]={'x','y','0','1'};
const array<int,4> f2[4]={{0,0,1,1},{0,1,0,1},{0,0,0,0},{1,1,1,1}};
int h[4][L],lst[L];
array<int,4> gt(int l,int r)
{
    // printf("[%d,%d]\n",l,r);
    assert(l>=1&&r<=L&&l<=r);
    if(l==r)
    {
        For(i,0,3) if(str[l]==ch2[i])
            return f2[i];
    }
    Rof(i,0,3)
    {
        exc(h[i][r]<=l);
        auto t1=gt(l,h[i][r]-1),t2=gt(h[i][r]+1,r);
        array <int,4> t; For(k,0,3) t[k]=f[i][t1[k]][t2[k]];
        return t;
    }
    if(str[l]=='!')
    {
        auto t=gt(l+1,r);
        return {!t[0],!t[1],!t[2],!t[3]};
    }
    else return gt(l+1,r-1);
    return {-1,-1,-1,-1};
}
array <int,4> fun()
{
    scanf("%s",str+1);
    int len=strlen(str+1);
    For(opt,0,3)
    {
        For(i,0,len) lst[i]=0;
        int k=0;
        For(i,1,len)
        {
            if(str[i]=='(') k++;
            else if(str[i]==')') k--;
            else if(str[i]==ch[opt]) lst[k]=i;
            h[opt][i]=lst[k];
        }
    }
    return gt(1,len);
}
int g[2][2][P][P],g2[P][P];
int ans[Q_];
bitset <P> z[P],z2[P];
void main_solve()
{
    // while(true)
    // {
    //     auto t=fun();
    //     printf("%d %d %d %d\n",t[0],t[1],t[2],t[3]);
    // }
    int Q; inpr(Q,n); p=1<<n;
    For(k1,0,1) For(k2,0,1) For_(i,0,p) For_(j,0,p)
        g[k1][k2][i][j]=Q+1;
    For(i,1,Q)
    {
        // printf("i=%d\n",i);
        int k1,k2; inpr(k1,k2); k1--,k2--;
        auto t=fun();
        // printf("%d,%d,%d,%d\n",t[0],t[1],t[2],t[3]);
        inint(ans[i]);
        For(z1,0,1) For(z2,0,1) if(t[(z1<<1|z2)])
            get_min(g[z1][z2][((p-1)^(1<<k1))][((p-1)^(1<<k2))],i);
    }
    inint(ans[Q+1]);
    For_(i,0,p) For_(j,0,p) g2[i][j]=Q+1;
    For(k1,0,1) For(k2,0,1)
    {
        Rof(i,0,p-1) Rof(j,0,p-1)
        {
            get_min(g2[(i^(k1?(p-1):0))][(j^(k2?(p-1):0))],g[k1][k2][i][j]);
            For_(k,0,n)
            {
                if(i>>k&1) get_min(g[k1][k2][(i^(1<<k))][j],g[k1][k2][i][j]);
                if(j>>k&1) get_min(g[k1][k2][i][(j^(1<<k))],g[k1][k2][i][j]);
            }
        }
    }
    For_(i,0,p) For_(j,0,p) z[i][j]=z2[j][i]=ans[g2[i][j]];
    int ans1=0; For_(i,0,p) ans1+=z[i][i];
    int ans2=0; For_(i,0,p) For_(j,0,p) if(z[i][j]&&z[j][i]) ans2++;
    int ans3=0; For_(i,0,p) For_(j,0,p) if(!z[i][j]) ans3+=(z[i]&z2[j]).count();
    printf("%d %d %d\n",ans1,ans2,ans3);
}
int main()
{
    // ios::sync_with_stdio(0); cin.tie(0);
    // freopen("ex_A3.in","r",stdin);
    // freopen("out.txt","w",stdout);
    // srand(time(NULL));
    main_init();
    // int _; inint(_); For(__,1,_) // T>1 ?
        // printf("\n------------\n\n"),
        main_solve();
    return 0;
}
/*

*/