#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <cmath>
#include <map>
#include <queue>
#include <iomanip>
#include <set>
#include <tuple>
#define mkp make_pair
#define mkt make_tuple
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define all(v) v.begin(),v.end()
using namespace std;
typedef long long ll;
const ll MOD=1e9+7;
template<class T> void chmin(T &a,const T &b){if(a>b) a=b;}
template<class T> void chmax(T &a,const T &b){if(a<b) a=b;}

typedef long double ld;

int N;
long double P,Q,R;
string S;

ld expression(int &i);
ld term(int &i);
ld factor(int &i);
ld constant(int &i);

ld expression(int &i){
  return term(i);
}

ld term(int &i){
  ld result=factor(i);
  while(i<S.size()){
    if(S[i]=='o'){
      i+=2;
      ld rig=factor(i);

      ld res=(1-result)*(1-rig)*R+(1-(1-result)*(1-rig))*(1-R);
      result=res;
    }else{
      break;
    }
  }
  return result;
}

ld factor(int &i){
  ld result=constant(i);
  while(i<S.size()){
    if(S[i]=='a'){
      i+=3;
      ld rig=constant(i);

      ld res=result*rig*(1-R)+(1-result*rig)*R;
      result=res;
    }else{
      break;
    }
  }
  return result;
}

ld constant(int &i){
  if(S[i]=='Y'){
    i+=3;
    return 1;
  }else if(S[i]=='N'){
    i+=2;
    return 0;
  }else if(S[i]=='r'){
    i+=6;
    i++;//'('
    ld x=expression(i);
    ld y=expression(i);
    i++;//')'
    ld res=x*y*P+(1-x*y)*Q;
    return res;
  }else if(S[i]=='('){
    i++;
    ld res=expression(i);
    i++;
    return res;
  }
}

int main(){
  cin.tie(0);
  ios::sync_with_stdio(false);

  cin>>N;
  cin>>P>>Q>>R;
  cin>>S;

  int i=0;
  ld ans=expression(i);
  ans*=100;
  int output=round(ans+0.1);
  cout<<output<<endl;


  return 0;
}