#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
#include <cmath>
#include <bitset>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <algorithm>
#include <complex>
#include <unordered_map>
#include <unordered_set>
#include <random>
#include <cassert>
#include <fstream>
#include <utility>
#include <functional>
#include <time.h>
#include <stack>
#include <array>
#define popcount __builtin_popcount
#define popcountll __builtin_popcountll
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
int n;
double p, q, r;
string s;
double yesno(int&);
double factor(int&);
double calcand(int&);
double expr(int&);
double yesno(int &i){
	if(s[i]=='Y'){
		i+=3;
		return 1;
	}else{
		i+=2;
		return 0;
	}
}
double factor(int &i){
	if(s[i]=='('){
		i++;
		double ret=expr(i);
		i++;
		return ret;
	}else if(s[i]=='r'){
		i+=6;
		i++;
		double ret1=expr(i);
		double ret2=expr(i);
		i++;
		return ret1*ret2*p+(1-ret1*ret2)*q;
	}else{
		return yesno(i);
	}
}
double calcand(int &i){
	double ret=factor(i);
	while(1){
		if(i==n) break;
		if(s[i]=='a'){
			i+=3;
			double ret1=factor(i);
			ret=(1-ret*ret1)*r+ret*ret1*(1-r);
		}else{
			break;
		}
	}
	return ret;
}
double expr(int &i){
	double ret=calcand(i);
	while(1){
		if(i==n) break;
		if(s[i]=='o'){
			i+=2;
			double ret1=calcand(i);
			ret=(1-ret)*(1-ret1)*r+(1-(1-ret)*(1-ret1))*(1-r);
		}else{
			break;
		}
	}
	return ret;
}
int main()
{
	cin>>n>>p>>q>>r>>s;
	int i=0;
	double ans=expr(i)*100;
	cout<<(int)(ans+1e-9)<<endl;
	return 0;
}