#include <algorithm>
#include <cstdio>
#include <cstring>
#include <vector>

#define debug(...) fprintf(stderr, __VA_ARGS__)

const double eps = 1e-8;

int dcmp(double x) {return x < -eps ? -1 : x > eps;}
struct Point {
  double x, y;
  Point(double x = 0, double y = 0) : x(x), y(y) {}
  Point operator+(Point b) {return Point(x + b.x, y + b.y);}
  Point operator-(Point b) {return Point(x - b.x, y - b.y);}
  Point operator*(double p) {return Point(x * p, y * p);}
  Point operator/(double p) {return Point(x / p, y / p);}
  double operator*(Point b) {return x * b.x + y * b.y;}
  double operator^(Point b) {return x * b.y - y * b.x;}
  bool operator==(Point b) {
    return !dcmp(x - b.x) && !dcmp(y - b.y);
  }
};
bool onLine(Point p, Point a, Point b) {return dcmp((p - a) ^ (p - b)) == 0;}
bool onSeg(Point p, Point a, Point b) {
  return dcmp((p - a) * (p - b)) <= 0 && onLine(p, a, b);
}
Point inter(Point a, Point b, Point c, Point d) {
  Point x = b - a, y = d - c, z = a - c;
  return a + (x * ((y ^ z) / (x ^ y)));
}
using vPoint = std::vector<Point>;
struct Line {
  Point a, b;
};

int n, rt, len, x0, x1, y0, y1;
char s[10005];
Line L[305];
double ans;

int sz;
struct Node {
  int ls, rs, id;
} t[10005];
int build(int l, int r) {
  int i = ++sz;
  if (s[l] == '[') {
    int a, b, c;
    sscanf(s + l, "[%d,%d,%d]", &a, &b, &c);
    Point p1, p2; 
    if (b) {
      p1 = Point(0, -double(c) / b);
      p2 = Point(1, -double(c + a) / b);
    } else {
      p1 = Point(-double(c) / a, 0);
      p2 = Point(-double(c) / a, 1);
    }
    L[++n] = {p1, p2};
    t[i].id = l;
  } else if (s[l + 1] == '!') {
    t[i].id = -1;
    t[i].ls = build(l + 2, r - 1);
  } else {
    int tp = 0;
    for (int j = l + 1; j < r; ++j) {
      if (s[j] == '(') ++tp;
      if (s[j] == ')') --tp;
      if (!tp && (s[j] == '&' || s[j] == '|' || s[j] == '^')) {
        t[i].id = s[j] == '&' ? -2 : s[j] == '|' ? -3 : -4;
        t[i].ls = build(l + 1, j - 1);
        t[i].rs = build(j + 1, r - 1);
        break;
      }
    }
  }
  return i;
}
int solve(int u, Point p) {
  if (t[u].id == -1) return !solve(t[u].ls, p);
  if (t[u].id == -2) return solve(t[u].ls, p) & solve(t[u].rs, p);
  if (t[u].id == -3) return solve(t[u].ls, p) | solve(t[u].rs, p);
  if (t[u].id == -4) return solve(t[u].ls, p) ^ solve(t[u].rs, p);
  int a, b, c;
  sscanf(s + t[u].id, "[%d,%d,%d]", &a, &b, &c);
  return dcmp(a * p.x + b * p.y + c) >= 0;
}

void dfs(vPoint A, int cur) {
  int m = A.size();
  if (cur == n + 1) {
    Point p;
    for (auto u : A) p = p + u;
    p = p / m;
    if (solve(rt, p))
      for (int i = 0; i < m; ++i) ans += (A[i] ^ A[(i + 1) % m]);
    return;
  }
  bool f1 = 0, f2 = 0;
  Point c = L[cur].a, d = L[cur].b;
  for (int i = 0; i < m; ++i) {
    f1 |= dcmp((d - c) ^ (A[i] - c)) > 0;
    f2 |= dcmp((d - c) ^ (A[i] - c)) < 0;
  }
  if (!f1 || !f2) dfs(A, cur + 1);
  else {
    vPoint A1, A2;
    Point ia, ib;
    int id = -1;
    for (int i = 0, cnt = 0; i < m; ++i) {
      Point a = A[i], b = A[(i + 1) % m];
      if (dcmp((a - c) ^ (d - c)) > 0) A1.push_back(a);
      if (dcmp((a - c) ^ (d - c)) < 0) A2.push_back(a);
      if (!dcmp((b - a) ^ (d - c))) continue;
      Point e = inter(a, b, c, d);
      if (onSeg(e, a, b)) A1.push_back(e), A2.push_back(e);
    }
    A1.erase(std::unique(A1.begin(), A1.end()), A1.end());
    A2.erase(std::unique(A2.begin(), A2.end()), A2.end());
    if (A1.back() == A1[0]) A1.pop_back();
    if (A2.back() == A2[0]) A2.pop_back();
    dfs(A1, cur + 1);
    dfs(A2, cur + 1);
  }
}

int main() {
  scanf("%d%d%d%d%s", &x0, &x1, &y0, &y1, s);
  len = strlen(s);
  rt = build(0, len - 1);
  vPoint A = {Point(x0, y0), Point(x1, y0), Point(x1, y1), Point(x0, y1)};
  dfs(A, 1);
  printf("%.6f\n", ans / 2);
  return 0;
}