#include <bits/stdc++.h>
#define ll long long
#define INF 1000000005
#define MOD 1000000007
#define EPS 1e-10
#define rep(i,n) for(int i=0;i<(int)(n);++i)
#define rrep(i,n) for(int i=(int)(n)-1;i>=0;--i)
#define srep(i,s,t) for(int i=(int)(s);i<(int)(t);++i)
#define each(a,b) for(auto (a): (b))
#define all(v) (v).begin(),(v).end()
#define len(v) (int)(v).size()
#define zip(v) sort(all(v)),v.erase(unique(all(v)),v.end())
#define cmx(x,y) x=max(x,y)
#define cmn(x,y) x=min(x,y)
#define fi first
#define se second
#define pb push_back
#define show(x) cout<<#x<<" = "<<(x)<<endl
#define spair(p) cout<<#p<<": "<<p.fi<<" "<<p.se<<endl
#define svec(v) cout<<#v<<":";rep(kbrni,v.size())cout<<" "<<v[kbrni];cout<<endl
#define sset(s) cout<<#s<<":";each(kbrni,s)cout<<" "<<kbrni;cout<<endl
#define smap(m) cout<<#m<<":";each(kbrni,m)cout<<" {"<<kbrni.first<<":"<<kbrni.second<<"}";cout<<endl

using namespace std;

typedef pair<int,int> P;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<double> vd;
typedef vector<P> vp;
typedef vector<string> vs;

const int MAX_N = 100005;

class UF {
private:
    int sz; vector<int> par,nrank;
public:
    UF(){}
    UF(int node_size){ sz = node_size; par.resize(sz),nrank.resize(sz); rep(i,sz){ par[i] = i; nrank[i] = 0; } }
    int find(int x){ if(par[x] == x){ return x; }else{ return par[x] = find(par[x]); } }
    void unite(int x,int y)
    { x = find(x),y = find(y); if(x == y) return;
    	if(nrank[x] < nrank[y]){ par[x] = y; }else{ par[y] = x; if(nrank[x] == nrank[y]) nrank[x]++; } }
    bool same(int x,int y){ return find(x) == find(y); }
};

string s;

void dfs(int& id,vi& vec)
{
    vvi val;
    vector<char> enz;
    while(id < len(s)){
        if(isdigit(s[id])){
            string t;
            vi hoge;
            while(isdigit(s[id])){
                t += s[id];
                id++;
            }
            hoge.pb(stoi(t));
            val.pb(hoge);
        }else if(s[id] == '('){
            id++;
            vi vv;
            dfs(id,vv);
            zip(vv);
            val.pb(vv);
        }else if(s[id] == ')'){
            id++;
            break;
        }else{
            enz.pb(s[id]);
            id++;
        }
    }
    // svec(enz);
    // rep(i,len(val)){
    //     svec(val[i]);
    // }
    vi num(len(enz));
    vvi temp = val;
    iota(all(num),0);
    do{
        UF uf(len(val));
        val = temp;
        for(int i:num){
            vi res;
            int a = uf.find(i),b = uf.find(i+1);
            rep(j,len(val[a])){
                rep(k,len(val[b])){
                    if(enz[i] == '+'){
                        res.pb(val[a][j]+val[b][k]);
                    }else if(enz[i] == '-'){
                        res.pb(val[a][j]-val[b][k]);
                    }else if(enz[i] == '*'){
                        res.pb(val[a][j]*val[b][k]);
                    }else{
                        if(val[b][k] != 0){
                            res.pb(val[a][j]/val[b][k]);
                        }
                    }
                }
            }
            uf.unite(a,b);
            val[uf.find(a)] = res;
        }
        int hoge = uf.find(0);
        rep(i,len(val[hoge])){
            vec.pb(val[hoge][i]);
        }
    }while(next_permutation(all(num)));
}

int main()
{
    cin.tie(0);
    ios::sync_with_stdio(false);
    while(1){
        cin >> s;
        if(s == "#"){
            break;
        }
        int id = 0;
        vi vec;
        dfs(id,vec);
        zip(vec);
        // svec(vec);
        cout << len(vec) << "\n";
    }
    return 0;
}

Measured memory_bytes: 6356