#include <bits/stdc++.h>

using namespace std;
using ll = long long;
// #define int ll
using PII = pair<ll, ll>;

#define FOR(i, a, n) for (ll i = (ll)a; i < (ll)n; ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(x) x.begin(), x.end()

template<typename T> T &chmin(T &a, const T &b) { return a = min(a, b); }
template<typename T> T &chmax(T &a, const T &b) { return a = max(a, b); }
template<typename T> bool IN(T a, T b, T x) { return a<=x&&x<b; }
template<typename T> T ceil(T a, T b) { return a/b + !!(a%b); }

template<typename T> vector<T> make_v(size_t a) { return vector<T>(a); }
template<typename T,typename... Ts>
auto make_v(size_t a,Ts... ts) {
    return vector<decltype(make_v<T>(ts...))>(a,make_v<T>(ts...));
}
template<typename T,typename V> typename enable_if<is_class<T>::value==0>::type
fill_v(T &t, const V &v) { t=v; }
template<typename T,typename V> typename enable_if<is_class<T>::value!=0>::type
fill_v(T &t, const V &v ) { for(auto &e:t) fill_v(e,v); }

template<class S,class T>
ostream &operator <<(ostream& out,const pair<S,T>& a) {
    out<<'('<<a.first<<','<<a.second<<')'; return out;
}
template<class T>
ostream &operator <<(ostream& out,const vector<T>& a){
    out<<'[';
    for(const T &i: a) out<<i<<',';
    out<<']';
    return out;
}
template<class T>
ostream &operator <<(ostream& out, const set<T>& a) {
    out<<'{';
    for(const T &i: a) out<<i<<',';
    out<<'}';
    return out;
}
template<class T, class S>
ostream &operator <<(ostream& out, const map<T,S>& a) {
    out<<'{';
    for(auto &i: a) out<<i<<',';
    out<<'}';
    return out;
}

int dx[] = {0, 1, 0, -1}, dy[] = {1, 0, -1, 0}; // DRUL
const int INF = 1<<30;
const ll LLINF = 1LL<<60;
const ll MOD = 1000000007;

string s, p;
ll pos;

ll Hash();
ll letter();

ll Hash() {
    ll ret;
    if(s[pos] == '[') {
        pos++;
        if(s[pos] == '+') {
            pos++;
            ll vl = Hash();
            ll vr = Hash();
            ret = vl | vr;
        } else if(s[pos] == '*') {
            pos++;
            ll vl = Hash();
            ll vr = Hash();
            ret = vl & vr;
        } else if(s[pos] == '^') {
            pos++;
            ll vl = Hash();
            ll vr = Hash();
            ret = vl ^ vr;
        } else {
            assert(false);
        }
        pos++;
    } else {
        ret = letter();
        pos++;
    }
    return ret;
}

ll letter() {
    if(s[pos] == 'a') return p[0]-'0';
    else if(s[pos] == 'b') return p[1]-'0';
    else if(s[pos] == 'c') return p[2]-'0';
    else if(s[pos] == 'd') return p[3]-'0';
    assert(false);
}

signed main(void)
{
    cin.tie(0);
    ios::sync_with_stdio(false);

    while(1) {
        cin >> s;
        if(s == ".") break;
        cin >> p;
        pos = 0;
        ll myHash = Hash();

        ll ret = 0;
        REP(i, 10) REP(j, 10) REP(k, 10) REP(l, 10) {
            p[0] = '0'+i;
            p[1] = '0'+j;
            p[2] = '0'+k;
            p[3] = '0'+l;
            pos = 0;
            if(myHash == Hash()) {
                // cout << p << endl;
                ret++;
            }
        }

        cout << myHash << " " << ret << endl;
    }

    return 0;
}



Measured memory_bytes: 3156