#include<bits/stdc++.h>
using std::cin, std::cout;
using ll = long long;
using db = long double;
struct vec2 { db x, y; };
const db eps = 1e-9;
db sgn(db x) {
	return x < -eps ? -1 : x > eps;
}
vec2 operator + (vec2 x, vec2 y) { return {x.x + y.x, x.y + y.y}; }
vec2 operator - (vec2 x, vec2 y) { return {x.x - y.x, x.y - y.y}; }
vec2 operator / (vec2 x, db y) { return {x.x / y, x.y / y}; }
db operator * (vec2 x, vec2 y) { return x.x * y.y - x.y * y.x; }
vec2 r90(vec2 x) {
	return {-x.y, x.x};
}
struct line : vec2 {
	db z;
	line() {}
	line(vec2 x, vec2 y) : vec2{r90(y - x)}, z(x * y) {

	}
	line flip() const {
		return line(-x, -y, -z);
	}
	line(db a, db b, db c) : vec2{a, b}, z(c) {}
	db operator () (vec2 a) const { return a.x * x + a.y * y + z; }
};
vec2 operator & (line x, line y) {
	return vec2{vec2{x.z, x.y} * vec2{y.z, y.y}, vec2{x.x, x.z} * vec2{y.x, y.z}} / -(vec2(x) * vec2(y));
}
std::vector<vec2> cut(const std::vector<vec2> & o, line l) {
	std::vector<vec2> res;
	int n = size(o);
	for(int i = 0;i < n;++i) {
		vec2 a = o[i], b = o[(i + 1) % o.size()];
		if(sgn(l(a)) >= 0) res.push_back(a);
		if(sgn(l(a)) * sgn(l(b)) < 0) res.push_back(line(a, b) & l);
	}
	return res;
}
std::vector<std::vector<vec2>> convs, tmp;
const int N = 300;
const int M = N * N + 5;
line a[N];
int cnt;
int cc;
vec2 o[N];

vec2 x, y;
char s[1 << 20];
void solve(int & id) {
	if(s[id] == '(') {
		++ id;
		if(s[id] == '!') {
			solve(++id);
		} else {
			solve(id);
			solve(++id);
		}
		++id;
	} else {
		std::vector<std::string> ts;
		std::string t;
		for(;s[++id] != ']';) {
			if(s[id] == ',') {
				ts.push_back(t), t = "";
			} else {
				t += s[id];
			}
		}
		ts.push_back(t);
		a[cnt++] = line(atof(ts[0].c_str()), atof(ts[1].c_str()), atof(ts[2].c_str()));
		++id;
	}
}
std::bitset<M> solve1(int & id) {
	if(s[id] == '(') {
		++ id;
		if(s[id] == '!') {
			auto t = solve1(++id);
			++ id;
			return ~t;
		} else {
			auto le = solve1(id);
			char op = s[id];
			auto ri = solve1(++id);
			++id;
			if(op == '&') return le & ri;
			if(op == '|') return le | ri;
			if(op == '^') return le ^ ri;
			assert(0);
		}
	} else {
		std::vector<std::string> ts;
		std::string t;
		for(;s[++id] != ']';) {
			if(s[id] == ',') {
				ts.push_back(t), t = "";
			} else {
				t += s[id];
			}
		}
		ts.push_back(t);
		line z = line(atof(ts[0].c_str()), atof(ts[1].c_str()), atof(ts[2].c_str()));
		++id;
		std::bitset<M> res;
		for(int i = 0;i < cc;++i) {
			if(sgn(z(o[i])) == 1) res.set(i);
		}
		return res;
	}
}
int main() {
	std::ios::sync_with_stdio(false), cin.tie(0);
	cin >> x.x >> y.x;
	cin >> x.y >> y.y;
	convs.push_back({ {x.x, x.y}, {y.x, x.y}, {y.x, y.y}, {x.x, y.y} });
	cin >> s;
	int id = 0;
	solve(id);
	for(int i = 0;i < cnt;++i) {
		tmp = convs, convs.clear();
		for(auto x : tmp) {
			db min = 1e9, max = -1e9;
			for(vec2 t : x) {
				min = std::min(min, a[i](t));
				max = std::max(max, a[i](t));
			}
			if(sgn(max) == 1) {
				convs.push_back(cut(x, a[i]));
			}
			if(sgn(min) == -1) {
				convs.push_back(cut(x, a[i].flip()));
			}
		}
	}
	cc = size(convs);
	for(int i = 0;i < cc;++i) {
		for(vec2 x : convs[i]) o[i] = o[i] + x;
		o[i] = o[i] / db(convs[i].size());
	}
	id = 0;
	auto t = solve1(id);
	db ans = 0;
	for(int i = 0;i < cc;++i) if(t.test(i)) {
		db sum = 0;
		auto z = convs[i];
		for(int j = 2;j < z.size();++j) {
			sum += (z[j - 1] - z[0]) * (z[j] - z[0]);
		}
		ans += sum;
	}
	printf("%.10Lf\n", ans / 2);
}