#include <iostream>#include <cstring>#include <cstdlib>#include <cstdio>#include <sstream>#include <map>using namespace std;const int N = 200 + 5;struct Node {int beg, id, type;} a[N];struct Edge {int next, t;} e[N << 2];int n, m, M;double event[N], ans = 0;map<string, int> view;bool vis[N];void init(){n = m = M = 0;ans = 0;view.clear();memset(a, 0, sizeof(a));memset(vis, 0, sizeof(vis));}void add(int u, int v){e[++M].t = v;e[M].next = a[u].beg;a[u].beg = M;}char str[40];int input_Leaf(){int id = n++;double p;scanf(" <name>%[^<]</name>",str);string name(str);scanf(" <probability>%lf</probability>",&p);if (!view.count(name)) {view[name] = m++;}a[id].id = view[name];event[a[id].id] = p;scanf(" </leaf>");return id;}int input_Node(){int id = n++;scanf(" <value>%[^<]</value>",str);a[id].type = (str[0] == 'a');while (scanf(" <%[^>]>",str),str[0]!='/' ) {if (str[0] == 'n')add(id, input_Node());elseadd(id, input_Leaf());}return id;}bool judge(int u){if (a[u].beg == 0) {return vis[a[u].id];} else {bool ok[2] = {false, true};for (int cur = a[u].beg, v; v = e[cur].t; cur = e[cur].next) {bool tmp = judge(v);ok[0] = ok[0] || tmp;ok[1] = ok[1] && tmp;}return ok[a[u].type];}}void dfs(int i, double p){if (i == m) {if (judge(0))ans += p;return;}vis[i] = true;dfs(i + 1, p * event[i]);vis[i] = false;dfs(i + 1, p * (1.0 - event[i]));}int main(){string str;while (scanf(" <root>")==0) {init();input_Node();dfs(0, 1.0);printf("%.3lfn", ans);scanf(" ###");}return 0;}
