#include <bits/stdc++.h>
#include <unistd.h>

using namespace std;

#define DEBUG(x) cerr<<#x<<": "<<x<<endl;
#define DEBUG_VEC(v) cerr<<#v<<":";for(int i=0;i<v.size();i++) cerr<<" "<<v[i]; cerr<<endl
#define DEBUG_MAT(v) cerr<<#v<<endl;for(int i=0;i<v.size();i++){for(int j=0;j<v[i].size();j++) {cerr<<v[i][j]<<" ";}cerr<<endl;}


typedef long long ll;
#define vi vector<int>
#define vl vector<ll>
#define vii vector< vector<int> >
#define vll vector< vector<ll> >
#define vs vector<string>
#define pii pair<int,int>
#define pis pair<int,string>
#define psi pair<string,int>
#define pll pair<ll,ll>
template<class S, class T> pair<S, T> operator+(const pair<S, T> &s, const pair<S, T> &t) { return pair<S, T>(s.first + t.first, s.second + t.second); }
template<class S, class T> pair<S, T> operator-(const pair<S, T> &s, const pair<S, T> &t) { return pair<S, T>(s.first - t.first, s.second - t.second); }
template<class S, class T> ostream& operator<<(ostream& os, pair<S, T> p) { os << "(" << p.first << ", " << p.second << ")"; return os; }
#define X first
#define Y second
#define rep(i,n) for(int i=0;i<(n);i++)
#define rep1(i,n) for(int i=1;i<=(n);i++)
#define rrep(i,n) for(int i=(n)-1;i>=0;i--)
#define rrep1(i,n) for(int i=(n);i>0;i--)
#define REP(i,a,b) for(int i=a;i<b;i++)
#define in(x, a, b) (a <= x && x < b)
#define all(c) c.begin(),c.end()
template<class T> bool chmax(T &a, const T &b) { if (a<b) { a = b; return 1; } return 0; }
template<class T> bool chmin(T &a, const T &b) { if (a>b) { a = b; return 1; } return 0; }
#define UNIQUE(v) v.erase(std::unique(v.begin(), v.end()), v.end());
const ll inf = 1000000001;
const ll INF = (ll)1e18 + 1;
const ll MOD = 1000000007;
//const ll MOD = 998244353;
const double pi = 3.14159265358979323846;
#define Sp(p) cout<<setprecision(15)<< fixed<<p<<endl;
int dx[4] = { 1,0, -1,0 }, dy[4] = { 0,1,0,-1 };
int dx2[8] = { 1,1,0,-1,-1,-1,0,1 }, dy2[8] = { 0,1,1,1,0,-1,-1,-1 };
#define fio() cin.tie(0); ios::sync_with_stdio(false);
//#define mp make_pair


typedef string::const_iterator State;
class ParseError {};

int number(State&);
int factor(State&);
int formula(State&);

int number(State &begin) {
  ll ret = *begin - '0';
  begin++;
  return ret;
}

int factor(State &begin) {
  //DEBUG(*begin);
  begin++; // '('を飛ばす。
  ll ret = formula(begin);
  if (*begin == '*') {
    begin++;
    ll ret2 = formula(begin);
    begin++;
    return min(ret, ret2);
  }
  else if (*begin == '+') {
    begin++;
    ll ret2 = formula(begin);
    begin++;
    return max(ret, ret2);
  }
}


int formula(State &begin) {
  //DEBUG(*begin);
  for (;;) {
    if (isdigit(*begin)) {
      return number(begin);
    }
    else if (*begin == '-') {
      begin++;
      int ret = formula(begin);
      return 2 - ret;
    }
    else if (*begin == '(') {
      return factor(begin);
    }
  }
}

int main() {
  while (true) {
    string s;
    cin >> s;
    if (s == ".") return 0;
    int ans = 0;
    rep (p, 3) rep (q, 3) rep (r, 3) {
      string t = s;
      rep (i, t.size()) {
        if (t[i] == 'P') t[i] = p + '0';
        if (t[i] == 'Q') t[i] = q + '0';
        if (t[i] == 'R') t[i] = r + '0';
      }
      //DEBUG(t);
      State begin = t.begin();
      int ret = formula(begin);
      if (ret == 2) ans++;
    }
    cout << ans << endl;
  }
}



Measured memory_bytes: 3212