// dottle bot
#ifndef ONLINE_JUDGE
#define DEBUG
#endif
#include <stdio.h>
#include <string.h>
#include <algorithm>
#include <queue>
#include <vector>
#include <bitset>
#include <map>
#include <assert.h>
#include <math.h>
#include <set>
#include <random>
std::mt19937_64 rnd(586666);
#define nln puts("")
#define od(x) printf("%d",x)
#define odb(x) printf("%d ",x)
#define odl(x) printf("%d\n",x)
#define odp(x,y) printf("%d %d\n",x,y)
#define ol(x) puts("")
#define old(x) printf("%lld",x)
#define oldb(x) printf("%lld ",x)
#define oldl(x) printf("%lld\n",x)
#define oldp(x,y) printf("%lld %lld\n",x,y)
#define rg(x) for(int i=1;i<=(x);i++){
#define rg_(i,x) for(int i=1;i<=(x);i++){
#define fe(u) for(int i=h[u];i;i=e[i].nxt){int v=e[i].v;
#define gr }
#define rrg(x) for(int i=0;i<(x);i++){
#define rdln(a) a[i]=read();
#define rdln0(a,x) rrg(x) rdln(a) gr
#define rdln1(a,x) rg(x) rdln(a) gr

#define int long long
const int mod=998244353;
#ifdef int 
#define inf 0x3f3f3f3f3f3f3f3fll
#else 
#define inf 0x3f3f3f3f
#endif
inline int min(int a,int b){return a>b?b:a;}
inline int max(int a,int b){return a<b?b:a;}
#define cmlSEGMIN
#define cmlSEGMAX
#define cmlSEGSUM
class SegTreeAl{
#ifdef cmlSEGMIN
	int minn[1000005<<2];
#endif
#ifdef cmlSEGMAX
	int maxn[1000005<<2];
#endif
#ifdef cmlSEGSUM
	int sum[1000005<<2];
#endif
	int tag[1000005<<2];
#ifdef cmlSEGSUM
	void pushdown(int o,int l,int r)
#else 
	void pushdown(int o)
#endif
	{
		int&t=tag[o];
#ifdef cmlSEGMIN
		minn[o<<1]+=t;
		minn[o<<1|1]+=t;
#endif
#ifdef cmlSEGMAX
		maxn[o<<1]+=t;
		maxn[o<<1|1]+=t;
#endif
#ifdef cmlSEGSUM
		int m=l+r>>1;
		sum[o<<1]+=t*(m-l+1);
		sum[o<<1|1]+=t*(r-m);
#endif
		tag[o<<1]+=t;
		tag[o<<1|1]+=t;
		t=0;
	}
	void add(int o,int l,int r,int L,int R,int v)
	{
		if(L<=l&&r<=R)
		{
#ifdef cmlSEGMAX
			maxn[o]+=v;
#endif
#ifdef cmlSEGMIN
			minn[o]+=v;
#endif
#ifdef cmlSEGSUM
			sum[o]+=v*(r-l+1);
#endif
			tag[o]+=v;
			return;
		}
		int m=l+r>>1;
#ifdef cmlSEGSUM
		pushdown(o,l,r);
#else
		pushdown(o);
#endif
		if(L<=m)add(o<<1,l,m,L,R,v);
		if(m<R)add(o<<1|1,m+1,r,L,R,v);
#ifdef cmlSEGMAX
		maxn[o]=max(maxn[o<<1],maxn[o<<1|1]);
#endif
#ifdef cmlSEGMIN
		minn[o]=min(minn[o<<1],minn[o<<1|1]);
#endif
#ifdef cmlSEGSUM
		sum[o]=sum[o<<1]+sum[o<<1|1];
#endif
	}
#ifdef cmlSEGMIN
	int qmin(int o,int l,int r,int L,int R)
	{
		if(L<=l&&r<=R)
		{
			return minn[o];
		}
		int m=l+r>>1,res=inf;
#ifdef cmlSEGSUM
		pushdown(o,l,r);
#else
		pushdown(o);
#endif
		if(L<=m)res=min(res,qmin(o<<1,l,m,L,R));
		if(m<R)res=min(res,qmin(o<<1|1,m+1,r,L,R));
#ifdef cmlSEGMAX
		maxn[o]=max(maxn[o<<1],maxn[o<<1|1]);
#endif
#ifdef cmlSEGMIN
		minn[o]=min(minn[o<<1],minn[o<<1|1]);
#endif
#ifdef cmlSEGSUM
		sum[o]=sum[o<<1]+sum[o<<1|1];
#endif
		return res;
	}
#endif

#ifdef cmlSEGMAX
	int qmax(int o,int l,int r,int L,int R)
	{
		if(L<=l&&r<=R)
		{
			return maxn[o];
		}
		int m=l+r>>1,res=-inf;
#ifdef cmlSEGSUM
		pushdown(o,l,r);
#else
		pushdown(o);
#endif
		if(L<=m)res=max(res,qmax(o<<1,l,m,L,R));
		if(m<R)res=max(res,qmax(o<<1|1,m+1,r,L,R));
#ifdef cmlSEGMAX
		maxn[o]=max(maxn[o<<1],maxn[o<<1|1]);
#endif
#ifdef cmlSEGMIN
		minn[o]=min(minn[o<<1],minn[o<<1|1]);
#endif
#ifdef cmlSEGSUM
		sum[o]=sum[o<<1]+sum[o<<1|1];
#endif
		return res;
	}
#endif

#ifdef cmlSEGSUM
	int qsum(int o,int l,int r,int L,int R)
	{
		if(L<=l&&r<=R)
		{
			return sum[o];
		}
		int m=l+r>>1,res=0;
#ifdef cmlSEGSUM
		pushdown(o,l,r);
#else
		pushdown(o);
#endif
		if(L<=m)res+=qsum(o<<1,l,m,L,R);
		if(m<R)res+=qsum(o<<1|1,m+1,r,L,R);
#ifdef cmlSEGMAX
		maxn[o]=max(maxn[o<<1],maxn[o<<1|1]);
#endif
#ifdef cmlSEGMIN
		minn[o]=min(minn[o<<1],minn[o<<1|1]);
#endif
#ifdef cmlSEGSUM
		sum[o]=sum[o<<1]+sum[o<<1|1];
#endif
		return res;
	}
#endif
};
#define newe(n) struct Edge{int v,w,nxt;}e[2*n+5];\
typedef int arr[n+5];\
arr h;\
int cnt=1;\
inline void addedge(int u,int v,int w){e[cnt]=(Edge){v,w,h[u]};h[u]=cnt++;}\
struct node{\
	int u,d;\
	bool operator<(const node&b)const{return d>b.d;}\
};\
void dij(int s,int *d,int N)\
{\
	memset(d,0x3f,sizeof(int)*(N+3));\
	d[s]=0;std::priority_queue<node>q;q.push((node){s,0});\
	while(!q.empty())\
	{\
		int u=q.top().u,D=q.top().d;q.pop();if(D!=d[u])continue;\
		for(int i=h[u];i;i=e[i].nxt){int v=e[i].v,w=e[i].w;\
		if(d[u]+w<d[v])d[v]=d[u]+w,q.push((node){v,d[v]});\
		}\
	}\
}
#define mgs int fa[1<<22],sz[1<<22];\
inline int f(int x){return x==fa[x]?x:fa[x]=f(fa[x]);}\
inline int uf(int x,int y)\
{\
    int fx=f(x),fy=f(y);\
    if(fx==fy)return 0;\
    if(sz[fx]>sz[fy])fx^=fy^=fx^=fy;\
    fa[fx]=fy,sz[fy]+=sz[fx];\
    return 1;\
}
inline int read()
{
    int num=0,f=1;char c=getchar();
    while(c<48||c>57){if(c=='-')f=-1;c=getchar();}
    while(c>47&&c<58)num=num*10+(c^48),c=getchar();
    return num*f;
}
inline int re1d()
{
    char c=getchar();
    while(c<48||c>49)c=getchar();
    return c&1;
}
#ifdef cmlBIT
struct BIT{int a[1<<20|1],n;
void add(int x,int p){while(x<=n)a[x]+=p,x+=x&-x;}
int operator[](int x){int res=0;while(x)res+=a[x],x-=x&-x;return res;}
int operator()(int l,int r){return (*this)[r]-(*this)[l-1];}};
#endif
int rnv[1000005];
// #define COMB
#ifdef COMB
#ifndef int
#define int long long
#endif
int fac[1000005],inv[1000005];
#endif
void initprog()
{
#ifdef COMB
	fac[0]=inv[0]=inv[1]=1;
	rg(1000000)fac[i]=fac[i-1]*i%mod;gr
	rg(1000000)if(i>1)inv[i]=inv[mod%i]*(mod-mod/i)%mod;gr
	rg(1000000)rnv[i]=inv[i];gr
	rg(1000000)inv[i]=inv[i]*inv[i-1]%mod;gr
#endif
}
#ifdef COMB
int C(int n,int m)
{
	if(n==m||m==0)return 1;
	if(n<m)return 0;
	return fac[n]*inv[m]%mod*inv[n-m]%mod;
}
#endif
inline int qp(int a,int b){int c=1;while(b){if(b&1)c=c*a%mod;a=a*a%mod;b>>=1;}return c;}
inline int mae(int &a,int b){a+=b;if(a>=mod)a-=mod;return a;}
inline int mde(int &a,int b){a+=mod-b;if(a>=mod)a-=mod;return a;}
inline int mle(int &a,int b){a=a*b%mod;return a;}
inline int mve(int &a,int b){a=a*qp(b,mod-2)%mod;return a;}
inline int mxe(int &a,int b){return a=a>b?a:b;}
inline int mne(int &a,int b){return a=a<b?a:b;}
inline int ae(int a,int b){int c=a+b;return c>=mod?c-mod:c;}
inline int de(int a,int b){return ae(a,mod-b);}
inline int me(int a,int b){return a*b%mod;}
inline int mive(int &a,int b){a=a*rnv[b]%mod;return a;}
inline int ive(int a,int b){return a*rnv[b]%mod;}
inline int ve(int a,int b){return a*qp(b,mod-2)%mod;}
#ifdef cmlST
struct STmin{
	int a[21][1000005],n;
	void init(int N,int *b)
	{
		n=N;
		rg(n)a[0][i]=b[i];gr
		rg(20)rg_(j,n-(1<<i)+1)a[i][j]=min(a[i-1][j],a[i-1][j+(1<<i-1)]);gr gr
	}
	int q(int l,int r)
	{
		int d=std::__lg(r-l+1);
		return min(a[d][l],a[d][r-(1<<d)+1]);
	}
};
struct STmax{
	int a[21][1000005],n;
	void init(int N,int *b)
	{
		n=N;
		rg(n)a[0][i]=b[i];gr
		rg(20)rg_(j,n-(1<<i)+1)a[i][j]=max(a[i-1][j],a[i-1][j+(1<<i-1)]);gr gr
	}
	int q(int l,int r)
	{
		int d=std::__lg(r-l+1);
		return max(a[d][l],a[d][r-(1<<d)+1]);
	}
};
#endif
#ifdef cmlSAM
struct SAM{
	int ch[1000005][26],lnk[1000005],len[1000005],lst=1,cc=1;
	int sz[1000005];
	void insert(int c)
	{
		len[++cc]=len[lst]+1;sz[cc]=1;
		int p=lst;lst=cc;
		while(p&&ch[p][c]==0)ch[p][c]=cc,p=lnk[p];
		if(p==0)lnk[cc]=1;
		else
		{
			int x=ch[p][c];
			if(len[p]+1==len[x])lnk[cc]=x;
			else
			{
				int q=cc;++cc;
				lnk[cc]=lnk[x];
				lnk[x]=lnk[q]=cc;
				len[cc]=len[p]+1;
				memcpy(ch[cc],ch[x],sizeof(ch[cc]));
				while(p&&ch[p][c]==x)ch[p][c]=cc,p=lnk[p];
			}
		}
	}
	newe(1000005);
	long long ans;
	void build()
	{
		rg(cc)addedge(lnk[i],i,0);gr
	}
	void dfs(int u)
	{
		fe(u)dfs(v),sz[u]+=sz[v];gr
		if(sz[u]>1)ans=max(ans,1ll*sz[u]*len[u]);
	}
}t;
#endif
//常数定义
using namespace std;
const double eps = 1e-9;
const double PI = acos(-1.0);

int sgn(double x)//符号函数，eps使用最多的地方
{
    if (fabs(x) < eps)
        return 0;
    if (x < 0)
        return -1;
    else
        return 1;
}
struct Point
{
    double x, y;
    Point() {}
    Point(double _x, double _y) : x(_x), y(_y) {}
    Point operator-(const Point &b) const { return Point(x - b.x, y - b.y); }
    Point operator+(const Point &b) const { return Point(x + b.x, y + b.y); }

    double operator^(const Point &b) const { return x * b.y - y * b.x; } //叉积
    double operator*(const Point &b) const { return x * b.x + y * b.y; } //点积

    bool operator<(const Point &b) const { return x < b.x || (x == b.x && y < b.y); }
    bool operator==(const Point &b) const { return sgn(x - b.x) == 0 && sgn(y - b.y) == 0; }

    Point Rotate(double B, Point P) //绕着点P，逆时针旋转角度B(弧度)
    {
        Point tmp;
        tmp.x = (x - P.x) * cos(B) - (y - P.y) * sin(B) + P.x;
        tmp.y = (x - P.x) * sin(B) + (y - P.y) * cos(B) + P.y;
        return tmp;
    }
    void print()
    {
    	printf("%.3lf %.3lf\n",x,y);
    }
};
double dist(Point a, Point b) { return sqrt((a - b) * (a - b)); } //两点间距离
double len(Point a){return sqrt(a.x * a.x + a.y * a.y);}//向量的长度
struct Line
{
    Point s, e;
    Line() {}
    Line(Point _s, Point _e) : s(_s), e(_e) {}

    //两直线相交求交点
    //第一个值为0表示直线重合，为1表示平行,为2是相交
    //只有第一个值为2时，交点才有意义

    pair<int, Point> operator&(Line b) 
    {
        Point res = s;
        // puts("ss:");
        // s.print();e.print();
        // b.s.print();b.e.print();
        // puts("ee");
        if (sgn((s - e) ^ (b.s - b.e)) == 0)
        {
            if (sgn((s - b.e) ^ (b.s - b.e)) == 0)
                return make_pair(0, res); //重合
            else
                return make_pair(1, res); //平行
        }
        double t = ((s - b.s) ^ (b.s - b.e)) / ((s - e) ^ (b.s - b.e));
        res.x += (e.x - s.x) * t;
        res.y += (e.y - s.y) * t;
        return make_pair(2, res);
    }
};
std::vector<Point>a[305*305];
double xl=read(),xr=read(),yl=read(),yr=read();
int cc=0;
int pd(Point x,Line y)
{
	return sgn((x-y.s)^(x-y.e));
}

vector<Point>fix(vector<Point>a)
{
	vector<Point>b={a[0]};
	for(int i=1;i<a.size();i++)
		if(dist(a[i],b.back())>eps&&dist(a[i],b[0])>eps)b.push_back(a[i]);
	return b;
}
pair<vector<Point>,vector<Point>> join(vector<Point>a,Line b)
{
	int l=1e9,r=-1e9,cl=0;
	int L=1e9,R=-1e9,cll=0;
	for(int i=0;i<a.size();i++)
	{
		int x=(pd(a[i],b));
		if(x>=0)mne(l,i),mxe(r,i),cl++;
		if(x<=0)mne(L,i),mxe(R,i),cll++;
	}
	
	if(max(cl,cll)==a.size())return {};
	l=1e9,r=-1e9,cl=0;
	L=1e9,R=-1e9,cll=0;
	for(int i=0;i<a.size();i++)
	{
		int x=(pd(a[i],b));
		if(x>0)mne(l,i),mxe(r,i),cl++;
		if(x<0)mne(L,i),mxe(R,i),cll++;
	}
	if(l==0)std::swap(l,L),std::swap(r,R);
	// odp(l,r);
	Point A=(b&Line(a[l],a[(l+a.size()-1)%a.size()])).second;
	Point B=(b&Line(a[r],a[(r+a.size()+1)%a.size()])).second;
	// A.print(),B.print();
	vector<Point>c,d;
	c.push_back(A);for(int i=l;i<=r;i++)c.push_back(a[i]);c.push_back(B);
	d.push_back(B);
	for(int i=r+1;i<a.size();i++)d.push_back(a[i]);
	for(int i=0;i<l;i++)d.push_back(a[i]);
	d.push_back(A);
	return {fix(c),fix(d)};
}
int pd2(vector<Point>a,Line b)
{
	// for(int i=0;i<a.size();i++)printf("%d ",pd(a[i],b));puts("done");
	for(int i=0;i<a.size();i++)
	{
		int x=(pd(a[i],b));
		if(x<0)return 0;
	}
	return 1;
}
char z[1234567];
#define type tp
int type[1234567],cp,dp,lc[1234657],rc[1234567];
Line D[1234567];
int build()
{
	char c=getchar();
	while(c=='\n'||c=='\r')c=getchar();
	if(c=='!')
	{
		int z=++cp;
		type[z]=-(int)'!';
		// printf("read !");
		lc[z]=build();
		return z;
	}
	if(c=='[')
	{
		double x=read(),y=read(),z=read();
		++cp;++dp;
		// if(x==0)D[dp]=Line({0,z/y},)
		Point s=(x==0?(Point){0,-z/y}:(Point){-z/x,0});
		Point e=s+(Point){-y,x};
		D[dp]=Line(s,e);
		
		type[cp]=dp;
		// printf("read []");
		return cp;
	}
	else
	{
		
		int z=++cp;
		// printf("read ()");
		lc[z]=build();
		if(type[lc[z]]==-(int)'!')
		{
			type[z]=-(int)'=';
			getchar();
			return z;
		}
		type[z]=-getchar();
		// printf("read %c",-type[z]);
		rc[z]=build();
		getchar();
		return z;
	}
}
std::bitset<305*305>B[305];
std::bitset<305*305>dfs(int u)
{
	if(tp[u]>0)
	{
			std::bitset<305*305>ret;
		for(int i=0;i<=cc;i++)
		{
			if(!pd2(a[i],D[tp[u]]))
				ret.set(i);
		}
		// D[tp[u]].s.print();
		// D[tp[u]].e.print();
		// printf("tp=%d:",tp[u]);
		// for(int i=0;i<=cc;i++)printf("%d",ret.test(i));puts("");
		return ret;
		// }
	}
	else
	{
		char s=-tp[u];
		if(s=='=')return dfs(lc[u]);
		if(s=='!')return ~dfs(lc[u]);
		if(s=='&')return dfs(lc[u])&dfs(rc[u]);
		if(s=='|')return dfs(lc[u])|dfs(rc[u]);
		if(s=='^')return dfs(lc[u])^dfs(rc[u]);
	}
	return std::bitset<305*305>();
}
signed main()
{
	initprog();
	/*
	A---B
	|/  |
	|   |
	|   |
	C---D
	*/
	{
		
	Point C={xl,yl};
	Point D={xr,yl};
	Point B={xr,yr};
	Point A={xl,yr};
	a[0]={C,D,B,A};
	// a[0].push_back({C,D});
	// a[0].push_back({D,A});
	// a[0].push_back({A,B});
	// a[0].push_back({B,C});
	// auto [x,y]=join(a[0],Line({0,0.5},{.5,1}));
	// odp(x.size(),y.size());
	// for(auto [a,b]:y)printf("%.3lf %.3lf\n",a,b);
	}
	// scanf("%s",z);
	int R=build();
	for(int i=1;i<=dp;i++)
	{
		// printf("s=%.3lf %.3lf e=%.3lf %.3lf\n",D[i].s.x,D[i].s.y,D[i].e.x,D[i].e.y);
		int now=cc;
		for(int j=0;j<=now;j++)
		{
			auto [A,B]=join(a[j],D[i]);
			if(A.size())++cc,a[j]=A,a[cc]=B;
		}
	}
	// rg(cp)if(tp[i]<0)putchar(-tp[i]);printf(" ");odp(lc[i],rc[i]);gr
	// odl(R);
	double res=0;
	std::bitset<305*305>s=dfs(R);
	for(int i=0;i<=cc;i++)
	{
		if(s.test(i))
		{
			double t=0;
			for(int j=0;j<a[i].size();j++)
				res=res+(a[i][j]^a[i][(j+1)%a[i].size()])/2;
		}
		// printf("%d",s.test(i));
	}
	printf("%.12lf\n",res);
	// puts("");
		// for(int i=0;i<=cc;i++)
		// {
			// for(auto [x,y]:a[i])printf("(%.3lf %.3lf)",x,y);puts("");
		// }
		// puts("");
	
	return 0;
}