#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#include <memory>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <streambuf>
#include <string>
#include <typeinfo>
#include <utility>
#include <valarray>
#include <vector>
#include <climits>
#include <cstring>
#include <cassert>

#define rep(i, m, n) for(int i=int(m);i<int(n);i++)
#define all(c) begin(c),end(c)

template<typename T1, typename T2>
inline void chmin(T1 &a, T2 b) { if (a > b) a = b; }

template<typename T1, typename T2>
inline void chmax(T1 &a, T2 b) { if (a < b) a = b; }

typedef long long int ll;
using ll = long long int;
using ull = long long unsigned int;
using Int = long long int;
using uInt = long long unsigned int;
using Double = long double;
using namespace std;
#define INF (1 << 30) - 1
#define INFl (ll)5e15
#define DEBUG 0
#define dump(x)  cerr << #x << " = " << (x) << endl
#define MOD 1000000007


//edit
class Solve {
public:
    string s;

    vector<vector<bool>> checked;
    vector<vector<set<Int>>> dp;

    Int op(Int l, Int r, char o) {
        if (o == '+') {
            return l + r;
        } else if (o == '-') {
            return l - r;
        } else if (o == '*') {
            return l * r;
        } else {
            assert(r != 0);
            return l / r;
        }
    }

    set<Int> rec(Int l, Int r) {
        if (checked[l][r]) return dp[l][r];

        // 数字が現れたか, カッコの対応, 演算子が現れるか
        bool onlynum = true;
        vector<Int> opeidx;
        stack<char> st;

        for (int i = l; i <= r; ++i) {
            if (s[i] == '(') {
                st.push('(');
            } else if (s[i] == ')') {
                if (st.top() == '(') st.pop();
                else st.push(')');
            } else if (!isdigit(s[i]) && st.empty()) {
                opeidx.push_back(i);
            }

            if (!isdigit(s[i])) {
                onlynum = false;
            }
        }

        if (onlynum) {
            Int tmp = 0;
            for (int i = l; i <= r; ++i) {
                tmp *= 10;
                tmp += (s[i] - '0');
            }
            set<Int> ret;
            ret.insert(tmp);
            checked[l][r] = true;
            return dp[l][r] = ret;
        }

        if (!st.empty()) {
            dp[l][r] = set<Int>();
            checked[l][r] = true;
            return dp[l][r];
        }

        if (opeidx.empty()) {
            checked[l][r] = true;
            return dp[l][r] = rec(l + 1, r - 1);
        }


        set<Int> ret;
        for (auto m : opeidx) {
            set<Int> lefts = rec(l, m - 1);
            set<Int> rights = rec(m + 1, r);
            for (auto left : lefts) {
                for (auto right : rights) {
                    if (s[m] == '/' && right == 0) continue;
                    Int val = op(left, right, s[m]);
                    ret.insert(val);
                }
            }
        }


        checked[l][r] = true;
        return dp[l][r] = ret;
    }


    bool solve() {
        cin >> s;
        if (s == "#") return false;
        checked.resize(s.size(), vector<bool>(s.size()));
        dp.resize(s.size(), vector<set<Int>>(s.size()));

        set<Int> st = rec(0, s.size() - 1);

//        cout << "----b-----" << endl;
//        for (auto e : st) {
//            cout << e << endl;
//        }
//        cout << "----e-----" << endl;

        Int ans = st.size();
        cout << ans << endl;


        return true;
    }
};


int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(10);
//    std::ifstream in("input.txt");
//    std::cin.rdbuf(in.rdbuf());

    while (Solve().solve());

    return 0;
}



Measured memory_bytes: 3400