#include<iostream>
#include<cstdio>
#include<vector>
#include<bitset>
#include<cstdlib>
#include<random>
#include<algorithm>
#include<map>
#define N 10000
#define M 1000000
#define K 400
using namespace std;
const double eps=1e-9;
unsigned long long seed=random_device{}();
int read()
{
	char c=0;
	int sum=0,f=1;
	while (c!='-'&&(c<'0'||c>'9')) c=getchar();
	if (c=='-') c=getchar(),f=-1;
	while ('0'<=c&&c<='9') sum=sum*10+c-'0',c=getchar();
	return sum*f;
}
unsigned long long get_rand()
{
	seed^=(seed<<3);
	seed^=(seed>>5);
	seed^=(seed<<13);
	return seed;
}
struct reads
{
	int a,b,c,nw;
};
reads tong[N+1];
struct points
{
	double x,y;
	bool operator < (const points &t)const
	{
		return x!=t.x?x<t.x:y<t.y;
	}
	bool operator != (const points &t)const
	{
		return abs(x-t.x)>eps||abs(y-t.y)>eps;
	}
};
points dque[M+1],dque2[M+1];
struct lines
{
	double x1,y1,x2,y2;
};
lines st[M+1];
int leng,l1,r1,l2,r2,lengs,length,lengths,ls[N+1],rs[N+1],cl[N+1],rest[N+1],top,top2;
double ans;
unsigned long long rd[N+1];
vector<lines>v[M+1];
bitset<K+1>B;
bitset<K+1>delta[M+1];
string s;
char c[N+1];
vector<points>p[N+1];
map<unsigned long long,int>P;
bool check_cross(reads x,reads y)
{
	return x.a*y.b!=x.b*y.a;
}
points get_cross(reads x,reads y)
{
	return (points){1.0*(x.c*y.b-x.b*y.c)/(x.b*y.a-x.a*y.b),1.0*(x.c*y.a-x.a*y.c)/(x.a*y.b-x.b*y.a)};
}
double operator * (points a,points b)
{
	return a.x*b.y-a.y*b.x;
}
bool cmp(points a,points b)
{
	return a*b>0;
}
int get_read(int l,int r)
{
	if (s[l]=='-')
	{
		int res=0;
		for (int i=l+1;i<=r;++i) res=res*10+s[i]-'0';
		return -res;
	}
	else
	{
		int res=0;
		for (int i=l;i<=r;++i) res=res*10+s[i]-'0';
		return res;
	}
}
int build(int l,int r)
{
	int nw=++lengs;
	if (s[l]=='(')
	{
	    if (s[l+1]=='!') ls[nw]=build(l+2,r-1),c[nw]='!';
		else
		{
			int cnt=0,ps=0;
			for (int i=l+1;i<=r-1;++i)
			{
				if (s[i]=='('||s[i]=='[') cnt++;
				if (s[i]==')'||s[i]==']') cnt--;
				if (!cnt)
				{
					ps=i;
					break;
				}
			}
			ls[nw]=build(l+1,ps),rs[nw]=build(ps+2,r-1),c[nw]=s[ps+1];
		}
	}
	else
	{
		int ps=-1,ps2=-1;
		for (int i=l+1;i<=r-1;++i)
			if (s[i]==',')
			{
				if (ps==-1) ps=i;
				else ps2=i;
			}
		c[nw]='?',tong[++length]=(reads){get_read(l+1,ps-1),get_read(ps+1,ps2-1),get_read(ps2+1,r-1),nw};
	}
	return nw;
}
void dfs(int x)
{
	if (c[x]=='?') return;
	if (c[x]=='!') dfs(ls[x]),rest[x]=!rest[ls[x]];
	if (c[x]=='&') dfs(ls[x]),dfs(rs[x]),rest[x]=rest[ls[x]]&rest[rs[x]];
	if (c[x]=='|') dfs(ls[x]),dfs(rs[x]),rest[x]=rest[ls[x]]|rest[rs[x]];
	if (c[x]=='^') dfs(ls[x]),dfs(rs[x]),rest[x]=rest[ls[x]]^rest[rs[x]];
	return;
}
int main()
{
	int rt;
	unsigned long long d;
	points ds;
	l1=read(),r1=read(),l2=read(),r2=read(),cin>>s,rt=build(0,s.length()-1),tong[++length]=(reads){1,0,-l1,0},tong[++length]=(reads){-1,0,r1,0},tong[++length]=(reads){0,1,-l2,0},tong[++length]=(reads){0,-1,r2,0};
	for (int i=1;i<=length;++i)
		for (int j=i+1;j<=length;++j)
			if (check_cross(tong[i],tong[j]))
			{
				ds=get_cross(tong[i],tong[j]);
				if (l1-eps<=ds.x&&ds.x<=r1+eps&&l2-eps<=ds.y&&ds.y<=r2+eps) p[i].push_back(ds),p[j].push_back(ds);
			}
	for (int i=1;i<=length;++i)
	{
		sort(p[i].begin(),p[i].end()),rd[i]=get_rand();
		for (int j=1;j<p[i].size();++j)
			if (abs(p[i][j].x-p[i][j-1].x)>eps||abs(p[i][j].y-p[i][j-1].y)>eps)
				st[++leng]=(lines){p[i][j-1].x,p[i][j-1].y,p[i][j].x,p[i][j].y};
	}
	for (int i=1;i<=leng;++i)
	{
		for (int j=1;j<=length;++j)
		{
			if (abs(tong[j].a*st[i].x1+tong[j].b*st[i].y1+tong[j].c)<eps&&abs(tong[j].a*st[i].x2+tong[j].b*st[i].y2+tong[j].c)<eps) cl[j]=1;
			else if (tong[j].a*st[i].x1+tong[j].b*st[i].y1+tong[j].c+eps>0&&tong[j].a*st[i].x2+tong[j].b*st[i].y2+tong[j].c+eps>0) cl[j]=2;
			else cl[j]=0;
		}
		d=0,B.reset();
		for (int j=1;j<=length;++j)
			if (cl[j]>=1)
				d^=rd[j],B[j]=1;
		if (P.find(d)==P.end()) P[d]=++lengths,delta[lengths]=B;
		v[P[d]].push_back(st[i]);
		d=0,B.reset();
		for (int j=1;j<=length;++j)
			if (cl[j]==2)
				d^=rd[j],B[j]=1;
		if (P.find(d)==P.end()) P[d]=++lengths,delta[lengths]=B;
		v[P[d]].push_back(st[i]);
	}
	for (int i=1;i<=lengths;++i)
	{
		for (int j=1;j<=length;++j)
			if (tong[j].nw)
				rest[tong[j].nw]=delta[i][j];
		dfs(rt);
		if (rest[rt])
		{
			top=top2=0;
			for (int j=0;j<v[i].size();++j) dque[++top]=(points){v[i][j].x1,v[i][j].y1},dque[++top]=(points){v[i][j].x2,v[i][j].y2};
			sort(dque+1,dque+top+1);
			for (int j=2;j<=top;++j)
				if (dque[j]!=dque[1])
					dque2[++top2]=(points){dque[j].x-dque[1].x,dque[j].y-dque[1].y};
			sort(dque2+1,dque2+top2+1,cmp);
			for (int j=1;j<=top2-1;++j) ans+=dque2[j]*dque2[j+1]/2;
		}
    }
	printf("%0.12lf\n",ans);
	return 0;
}