#include #define For(i, a, b) for (int(i) = (int)(a); (i) < (int)(b); ++(i)) #define rFor(i, a, b) for (int(i) = (int)(a)-1; (i) >= (int)(b); --(i)) #define rep(i, n) For((i), 0, (n)) #define rrep(i, n) rFor((i), (n), 0) #define fi first #define se second #define double long double using namespace std; typedef long long lint; typedef unsigned long long ulint; typedef pair pii; typedef pair pll; template bool chmax(T &a, const T &b) { if (a < b) { a = b; return true; } return false; } template bool chmin(T &a, const T &b) { if (a > b) { a = b; return true; } return false; } template T div_floor(T a, T b) { if (b < 0) a *= -1, b *= -1; return a >= 0 ? a / b : (a + 1) / b - 1; } template T div_ceil(T a, T b) { if (b < 0) a *= -1, b *= -1; return a > 0 ? (a - 1) / b + 1 : a / b; } constexpr lint mod = 1000000007; constexpr lint INF = mod * mod; constexpr int MAX = 200010; double p, q, r; double expr(string &s, int &i); double term(string &s, int &i); double factor(string &s, int &i); double expr(string &s, int &i) { double ret = term(s, i); while (i < (int)s.size() && s[i] == 'o') { i += 2; double rhs = term(s, i); ret = 1 - (1 - ret) * (1 - rhs); ret = (1 - r) * ret + r * (1 - ret); } return ret; } double term(string &s, int &i) { double ret = factor(s, i); while (i < (int)s.size() && s[i] == 'a') { i += 3; double rhs = factor(s, i); ret = ret * rhs; ret = (1 - r) * ret + r * (1 - ret); } return ret; } double factor(string &s, int &i) { if (s[i] == '(') { ++i; double ret = expr(s, i); ++i; return ret; } else if (s[i] == 'r') { i += 7; double lhs = expr(s, i); double rhs = expr(s, i); ++i; return p * lhs * rhs + q * (1 - lhs * rhs); } else if (s[i] == 'Y') { i += 3; return 1; } else { i += 2; return 0; } } int main() { int n; string s; cin >> n >> p >> q >> r >> s; int i = 0; int ans = expr(s, i) * 100; cout << ans << "\n"; }