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

#define fs first
#define sc second

const LL MOD = 1e9+7;
const double EPS = 1e-10;

template<class T>bool chmax(T &a, const T &b) {
    if (a < b) { a = b; return true; }
    return false;
}
template<class T>bool chmin(T &a, const T &b) {
    if (b < a) { a = b; return true; }
    return false;
}

// std::vector Declaration
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...));
}

// std::vector Declaration and Initialization
template<typename T>
vector<T> make_vector(size_t a, T x) { return vector<T>(a, x); }
template<typename T, typename... Ts>
auto make_vector(size_t a, size_t b, Ts... ts) {
    return vector<decltype(make_vector<T>(b,ts...))>(a,make_vector<T>(b,ts...));
}

// std::vector Input
template<typename T>
istream& operator>>(istream& is, vector<T>& v) {
    for (auto &e : v) {
        is >> e;
    }
    return is;
}

// std::vector Debug
template<typename T>
ostream& operator<<(ostream& os, const vector<T>& v) {
    os << "[";
    bool a = 1;
    for (auto e : v) {
        os << (a ? "" : " ");
        os << e;
        a = 0;
    }
    os << "]";
    return os;
}

// std::array Debug
template<typename T, size_t n>
ostream& operator<<(ostream& os, const array<T, n>& v) {
    os << "[";
    bool a = 1;
    for (auto e : v) {
        os << (a ? "" : " ");
        os << e;
        a = 0;
    }
    os << "]";
    return os;
}

// std::deque Debug
template<typename T>
ostream& operator<<(ostream& os, const deque<T>& d) {
    os << "[";
    bool a = 1;
    for (auto e : d) {
        os << (a ? "" : " ");
        os << e;
        a = 0;
    }
    os << "]";
    return os;
}

// std::pair Debug
template<typename T, typename U>
ostream& operator<<(ostream& os, const pair<T, U>& p) {
    os << "(" << p.first << " " << p.second << ")";
    return os;
}

// std::set Debug
template<typename T>
ostream& operator<<(ostream& os, const set<T>& st) {
    os << "{";
    bool a = 1;
    for (auto e : st) {
        os << (a ? "" : " ");
        os << e;
        a = 0;
    }
    os << "}";
    return os;
}

// std::multiset Debug
template<typename T>
ostream& operator<<(ostream& os, const multiset<T>& st) {
    os << "{";
    bool a = 1;
    for (auto e : st) {
        os << (a ? "" : " ");
        os << e;
        a = 0;
    }
    os << "}";
    return os;
}

// std::map Debug
template<typename T, typename U>
ostream& operator<<(ostream& os, const map<T, U>& mp) {
    os << "{";
    bool a = 1;
    for (auto e : mp) {
        os << (a ? "" : " ");
        os << e.first << ":" << e.second;
        a = 0;
    }
    os << "}";
    return os;
}

// std::tuple Debug
template<int N, class Tuple>
void out(ostream& os, const Tuple& t){}
template<int N, class Tuple, class H, class ...Ts>
void out(ostream& os, const Tuple& t) {
    if (N) os << " ";
    os << get<N>(t);
    out<N+1,Tuple,Ts...>(os, t);
}
template<class ...Ts>
ostream& operator<<(ostream& os, const tuple<Ts...>& t) {
    os << "(";
    out<0,tuple<Ts...>,Ts...>(os, t);
    os << ")";
    return os;
}

// Debug
#define DUMP(x) cerr<<#x<<" = "<<(x)<<endl

// Weighted edge
template<typename T>
struct edge {
    int src, to;
    T cost;

    edge(int to, T cost) : src(-1), to(to), cost(cost) {}
    edge(int src, int to, T cost) : src(src), to(to), cost(cost) {}

    edge &operator=(const int &x) {
        to = x;
        return *this;
    }

    operator int() const { return to; }

    friend ostream& operator<<(ostream& os, const edge& e) {
        return os << "(" << e.src << "->" << e.to << ":" << e.cost << ")";
    }
};

template<typename T>
using Edges = vector<edge<T>>;
template<typename T>
using WeightedGraph = vector<Edges<T>>;
using UnWeightedGraph = vector<vector<int>>;
template<typename T>
using MatrixGraph = vector<vector<T>>;

using State = string::const_iterator;
class ParseError {};

set<int> num(State &begin) {
    int n = 0;
    while ('0' <= *begin && *begin <= '9') {
        n *= 10;
        n += (*begin - '0');
        begin++;
    }
    return set<int>{n};
}

set<int> expression(State &begin);

set<int> factor(State &begin) {
    if (*begin == '(') {
        begin++;
        auto ret = expression(begin);
        assert(*begin == ')');
        begin++;
        return ret;
    } else {
        return num(begin);
    }
}

set<int> expression(State &begin) {
    vector<set<int>> facts{factor(begin)};
    vector<char> ops;
    while (true) {
        if (*begin == '+' || *begin == '-' ||
            *begin == '*' || *begin == '/') {
            ops.push_back(*begin);
            begin++;
            facts.push_back(factor(begin));
        } else {
            break;
        }
    }

    int m = ops.size();
    vector<int> ord(m);
    iota(ord.begin(), ord.end(), 0);

    set<int> ret;
    do {
        vector<set<int>> buff = facts;
        bool invalid = false;
        for (auto i : ord) {
            int l = i, r = i+1;
            while (l >= 0 && buff[l].size() == 0) --l;
            if (l < 0) {
                invalid = true;
                break;
            }

            set<int> tmp;
            for (auto a : buff[l]) {
                for (auto b : buff[r]) {
                    if (ops[i] == '+') {
                        tmp.insert(a+b);
                    } else if (ops[i] == '-') {
                        tmp.insert(a-b);
                    } else if (ops[i] == '*') {
                        tmp.insert(a*b);
                    } else if (b != 0) {
                        tmp.insert(a/b);
                    }
                }
            }

            buff[l] = tmp;
            buff[r].clear();
        }

        if (invalid) continue;

        for (auto val : buff[0]) {
            ret.insert(val);
        }

    } while (next_permutation(ord.begin(), ord.end()));

    return ret;
}


int main()
{
    while (true) {
        string s; cin >> s;
        if (s[0] == '#') {
            break;
        }

        State begin = s.begin();
        auto ans = expression(begin);
        cout << ans.size() << endl;
    }

    return 0;
}



Measured memory_bytes: 3204