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 <iostream>
#include <iomanip>
#include <cstdio>
#include <string>
#include <cstring>
#include <deque>
#include <list>
#include <queue>
#include <stack>
#include <vector>
#include <utility>
#include <algorithm>
#include <map>
#include <set>
#include <complex>
#include <cmath>
#include <limits>
#include <cfloat>
#include <climits>
#include <ctime>
#include <cassert>
#include <numeric>
#include <fstream>
#include <functional>
#include <bitset>

using namespace std;
#define int long long int
const int INF = 1001001001001001LL;

int di[] = {-1, 0, 1, 0, -1, 1, 1, -1};
int dj[] = {0, 1, 0, -1, 1, 1, -1, -1};

string s;

int f(char a, char b, char c, char d, int l, int r){
    char op = s[l];
    
    if(op != '+' && op != '+' && op != '*'){
        if(op == 'a') return a - '0';
        if(op == 'b') return b - '0';
        if(op == 'c') return c - '0';
        if(op == 'd') return d - '0';
    }

    op = s[l + 1];

    int x, y;
    l += 2;
    if(s[l] == '['){
        int end = l;
        for(;; end++){
            
            if(s[end] == ']'){
                end++;
                break;
            }
        }

        x = f(a, b, c, d, l, end);
        l = end;
    }else{

        if(s[l] == 'a') x = a - '0';
        if(s[l] == 'b') x = b - '0';
        if(s[l] == 'c') x = c - '0';
        if(s[l] == 'd') x = d - '0';

        l++;
    }

    if(s[l] == '['){
        int end = l;
        for(;; end++){
            if(s[end] == ']'){
                end++;
                break;
            }
        }

        y = f(a, b, c, d, l, end);

    }else{
        if(s[l] == 'a') y = a - '0';
        if(s[l] == 'b') y = b - '0';
        if(s[l] == 'c') y = c - '0';
        if(s[l] == 'd') y = d - '0';
    }
    
    int ret;
    if(op == '+') ret = x | y;
    else if(op == '*') ret =  x & y;
    else ret = x ^ y;

    //cerr << op << " " << a << " " << b << " " << ret << endl;
    return ret;
}

signed main(){
    /*
    cin >> s;
    cout << f('0', '4', '0', '4', 0, s.size()) << endl;
    */
    while(1){
        cin >> s;
        if(s == ".") break;
        string p; cin >> p;
        int n = s.size();

        int val = f(p[0], p[1], p[2], p[3], 0, n);
        int ans = 0;
        
        for(char a = '0'; a <= '9'; a++){
            for(char b = '0'; b <= '9'; b++){
                for(char c = '0'; c <= '9'; c++){
                    for(char d = '0'; d <= '9'; d++){
                        if(val == f(a, b, c, d, 0, n)) ans++;
                    }
                }
            }
        }

        cout << val << " " << ans << endl;
    }

    return 0;
}

C++: #include <bits/stdc++.h>
#define r(i,n) for(int i=0;i<n;i++)
using namespace std;
int p,ans;
string s,t;
map<char,int>m;
map<int,int>cnt;

int bnf();

int get(){
  int res;
  if(s[p]=='[')p++,res=bnf(),p++;
  else if(isalpha(s[p]))res=m[s[p++]];
  return res;
}

int bnf(){
  int res=get(),a,b;
  while(s[p]=='+'||s[p]=='*'||s[p]=='^'){
    int tmp=p++;
    a=get();
    b=get();
    if(s[tmp]=='+')res=a|b;
    if(s[tmp]=='*')res=a&b;
    if(s[tmp]=='^')res=a^b;
  }
  return res;
}

void dfs(int d,string tt){
  if(d==4){
    p=0;
    m['a']=tt[0]-'0';
    m['b']=tt[1]-'0';
    m['c']=tt[2]-'0';
    m['d']=tt[3]-'0';
    int x=bnf();
    if(tt==t)ans=x;
    cnt[x]++;
    return;
  }
  r(i,10){
    string pp=tt;
    pp+=(i+'0');
    dfs(d+1,pp);
  }
}

int main(){
  while(cin>>s,s!="."){
    cin>>t;
    s+="@";
    cnt.clear();
    dfs(0,"");
    cout<<ans<<' '<<cnt[ans]<<endl;
  }
}