Go: package main

import (
	"bufio"
	"fmt"
	"os"
	"strconv"
	"strings"
)

func main() {
	io := NewIo()
	defer io.Flush()
	for {
		S := io.NextLine()
		if S == "." {
			break
		}
		P := io.NextLine()
		i := 0
		val := hash(S, P, &i)
		cnt := 0
		for j := 0; j < 10000; j++ {
			i = 0
			if hash(S, fmt.Sprintf("%04d", j), &i) == val {
				cnt++
			}
		}
		io.Println(val, cnt)
	}
}

func hash(s, n string, i *int) int {
	if s[*i] == '[' {
		*i++
		switch s[*i] {
		case '+':
			*i++
			l := hash(s, n, i)
			r := hash(s, n, i)
			*i++
			return l | r
		case '*':
			*i++
			l := hash(s, n, i)
			r := hash(s, n, i)
			*i++
			return l & r
		case '^':
			*i++
			l := hash(s, n, i)
			r := hash(s, n, i)
			*i++
			return l ^ r
		}
	}
	x := int(n[s[*i]-'a'] - '0')
	*i++
	return x
}

// I/O template
type Io struct {
	reader    *bufio.Reader
	writer    *bufio.Writer
	tokens    []string
	nextToken int
}

func NewIo() *Io {
	return &Io{
		reader: bufio.NewReader(os.Stdin),
		writer: bufio.NewWriter(os.Stdout),
	}
}

func (io *Io) Flush() {
	err := io.writer.Flush()
	if err != nil {
		panic(err)
	}
}

func (io *Io) NextLine() string {
	var buff []byte
	for {
		line, isPrefix, err := io.reader.ReadLine()
		if err != nil {
			panic(err)
		}
		buff = append(buff, line...)
		if !isPrefix {
			break
		}
	}
	return string(buff)
}

func (io *Io) Next() string {
	for io.nextToken >= len(io.tokens) {
		line := io.NextLine()
		io.tokens = strings.Fields(line)
		io.nextToken = 0
	}
	s := io.tokens[io.nextToken]
	io.nextToken++
	return s
}

func (io *Io) NextInt() int {
	i, err := strconv.Atoi(io.Next())
	if err != nil {
		panic(err)
	}
	return i
}

func (io *Io) NextFloat() float64 {
	i, err := strconv.ParseFloat(io.Next(), 64)
	if err != nil {
		panic(err)
	}
	return i
}

func (io *Io) Println(a ...interface{}) {
	fmt.Fprintln(io.writer, a...)
}

func (io *Io) Printf(format string, a ...interface{}) {
	fmt.Fprintf(io.writer, format, a...)
}

func (io *Io) PrintIntSlice(a []int) {
	b := []interface{}{}
	for _, x := range a {
		b = append(b, x)
	}
	io.Println(b...)
}

func (io *Io) PrintStringSlice(a []string) {
	b := []interface{}{}
	for _, x := range a {
		b = append(b, x)
	}
	io.Println(b...)
}

func Log(name string, value interface{}) {
	fmt.Fprintf(os.Stderr, "%s=%+v\n", name, value)
}

func ExampleIo() {
	io := NewIo()
	defer io.Flush()
	a := make([]int, 0, 3)
	a[0], a[1], a[2] = io.NextInt(), io.NextInt(), io.NextInt()
	io.Println(a)
	io.PrintIntSlice(a)
	Log("io", a)
}

C++: #include <bits/stdc++.h>
using namespace std;
using ll = long long;

string s;
int ind = 0;

struct E {
  int type;
  int op;
  E *l, *r;
  int index;
};

E *parse() {
  E *p = new E();
  if (s[ind] == '[') {
    p->type = 0;
    ind++;
    p->op = s[ind];
    ind++;
    p->l = parse();
    p->r = parse();
    ind++;
  } else {
    p->type = 1;
    p->index = s[ind] - 'a';
    ind++;
  }
  return p;
}

void fr(E *p) {
  if (p->type == 0) {
    fr(p->l);
    fr(p->r);
  }
  free(p);
}

ll eval(E *p, string s) {
  if (p->type == 0) {
    if (p->op == '+') {
      return eval(p->l, s) | eval(p->r, s);
    } else if (p->op == '*') {
      return eval(p->l, s) & eval(p->r, s);
    } else {
      return eval(p->l, s) ^ eval(p->r, s);
    }
  } else {
    return s[p->index] - '0';
  }
}

string num[10] = {"0", "1", "2", "3", "4", "5", "6", "7", "8", "9"};

int main() {
  while (true) {
    cin >> s;
    ind = 0;
    if (s == ".")
      break;
    string t;
    cin >> t;
    auto f = parse();
    int val = eval(f, t);
    int ans = 0;
    for (int i = 0; i < 10; i++)
      for (int j = 0; j < 10; j++)
        for (int k = 0; k < 10; k++)
          for (int l = 0; l < 10; l++) {
            string ss = num[i] + num[j] + num[k] + num[l];
            if (val == eval(f, ss))
              ans++;
          }
    cout << val << " " << ans << endl;
    fr(f);
  }
  return 0;
}

C++: #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;
}