#include <cassert>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

using namespace std;

using Int = long long;

template <class T1, class T2> ostream &operator<<(ostream &os, const pair<T1, T2> &a) { return os << "(" << a.first << ", " << a.second << ")"; };
template <class T> ostream &operator<<(ostream &os, const vector<T> &as) { const int sz = as.size(); os << "["; for (int i = 0; i < sz; ++i) { if (i >= 256) { os << ", ..."; break; } if (i > 0) { os << ", "; } os << as[i]; } return os << "]"; }
template <class T> void pv(T a, T b) { for (T i = a; i != b; ++i) cerr << *i << " "; cerr << endl; }
template <class T> bool chmin(T &t, const T &f) { if (t > f) { t = f; return true; } return false; }
template <class T> bool chmax(T &t, const T &f) { if (t < f) { t = f; return true; } return false; }
#define COLOR(s) ("\x1b[" s "m")

inline int sig(Int r) { return (r < 0) ? -1 : (r > 0) ? +1 : 0; }
inline Int sq(Int r) { return r * r; }
struct Pt {
  Int x, y;
  Pt() : x(0), y(0) {}
  Pt(Int x_, Int y_) : x(x_), y(y_) {}
  Pt operator+(const Pt &a) const { return Pt(x + a.x, y + a.y); }
  Pt operator-(const Pt &a) const { return Pt(x - a.x, y - a.y); }
  Pt operator*(const Pt &a) const { return Pt(x * a.x - y * a.y, x * a.y + y * a.x); }
  Pt operator+() const { return Pt(+x, +y); }
  Pt operator-() const { return Pt(-x, -y); }
  Pt operator*(const Int &k) const { return Pt(x * k, y * k); }
  Pt operator/(const Int &k) const { return Pt(x / k, y / k); }
  friend Pt operator*(const Int &k, const Pt &a) { return Pt(k * a.x, k * a.y); }
  Pt &operator+=(const Pt &a) { x += a.x; y += a.y; return *this; }
  Pt &operator-=(const Pt &a) { x -= a.x; y -= a.y; return *this; }
  Pt &operator*=(const Pt &a) { return *this = *this * a; }
  Pt &operator*=(const Int &k) { x *= k; y *= k; return *this; }
  Int abs2() const { return x * x + y * y; }
  Int dot(const Pt &a) const { return x * a.x + y * a.y; }
  Int det(const Pt &a) const { return x * a.y - y * a.x; }
  bool operator==(const Pt &a) const { return (x == a.x && y == a.y); }
  bool operator!=(const Pt &a) const { return !(x == a.x && y == a.y); }
  bool operator<(const Pt &a) const { return ((x != a.x) ? (x < a.x) : (y < a.y)); }
  friend ostream &operator<<(ostream &os, const Pt &a) { os << "(" << a.x << ", " << a.y << ")"; return os; }
};
inline Int tri(const Pt &a, const Pt &b, const Pt &c) { return (b - a).det(c - a); }

// [0, 2 PI)
int cmpArg(const Pt &a, const Pt &b) {
  const int sa = (a.y > 0) ? 1 : (a.y < 0) ? 3 : (a.x > 0) ? 0 : 2;
  const int sb = (b.y > 0) ? 1 : (b.y < 0) ? 3 : (b.x > 0) ? 0 : 2;
  return (sa < sb) ? -1 : (sa > sb) ? +1 : sig(b.det(a));
}

// Watch out for the case a == b.
int iSP(const Pt &a, const Pt &b, const Pt &c) {
  int s = sig((b - a).det(c - a));
  if (s) return s;
  if (sig((b - a).dot(c - a)) < 0) return -2; // c-a-b
  if (sig((a - b).dot(c - b)) < 0) return +2; //   a-b-c
  return 0;
}



// intersection = a + (numer/denom) (b - a)
pair<Int, Int> pLLRate(const Pt &a, const Pt &b, const Pt &c, const Pt &d) {
  const Pt ab = b - a, cd = d - c;
  return make_pair((c - a).det(cd), ab.det(cd));
}

bool insideWeaklyGS(const vector<Pt> &ps, const Pt &a, const Pt &b) {
  const int psLen = ps.size();
  assert(psLen >= 3);
  assert(a != b);
  const Pt ab = b - a;
  // number of intersections of ps (enlarged) and ray a-b
  int cnt = 0;
  for (int i = 0; i < psLen; ++i) {
    const Pt &p0 = ps[i];
    const Pt &p1 = ps[(i + 1 >= psLen) ? (i + 1 - psLen) : (i + 1)];
    const Pt &p2 = ps[(i + 2 >= psLen) ? (i + 2 - psLen) : (i + 2)];
    const int s0 = sig(tri(a, b, p0));
    const int s1 = sig(tri(a, b, p1));
    // in p0-p1
    if (s0 * s1 < 0) {
      const auto res = pLLRate(a, b, p0, p1);
      const Int numer = (res.second < 0) ? -res.first : res.first;
      const Int denom = (res.second < 0) ? -res.second : res.second;
      if (numer <= 0) {
      } else if (numer >= denom) {
        ++cnt;
      } else {
        return false;
      }
    }
    // at p1
    if (s1 == 0) {
      const int s2 = sig(tri(a, b, p2));
      if (s0 * s2 < 0 || (s0 != s2 && sig(tri(p0, p1, p2)) > 0)) {
        const Int numer = ab.dot(p1 - a);
        const Int denom = ab.abs2();
        if (numer <= 0) {
        } else if (numer >= denom) {
          ++cnt;
        } else {
          return false;
        }
      }
    }
  }
  return (cnt % 2 != 0);
}



constexpr int MAX = 410;
constexpr Int INF = 1001001001001001001LL;

int N;
vector<Pt> P;
Int W, C;

bool can[MAX][MAX];
int ids[MAX][MAX];
Int dp[MAX][MAX];

int main() {
  for (; ~scanf("%d", &N); ) {
    P.resize(N);
    for (int u = 0; u < N; ++u) {
      scanf("%lld%lld", &P[u].x, &P[u].y);
    }
    scanf("%lld%lld", &W, &C);
    
    memset(can, 0, sizeof(can));
    for (int u = 0; u < N; ++u) for (int v = u + 1; v < N; ++v) {
      if (insideWeaklyGS(P, P[u], P[v])) {
// cerr<<"inside "<<u<<" "<<v<<endl;
        bool ok = true;
        for (int w = 0; w < N; ++w) if (u != w && v != w) {
          ok = ok && (iSP(P[u], P[v], P[w]) != 0);
        }
        if (ok) {
// cerr<<"edge "<<u<<" "<<v<<endl;
          can[u][v] = true;
        }
      }
    }
    
    vector<pair<int, int>> es;
    for (int u = 0; u < N; ++u) for (int v = u + 1; v < N; ++v) if (can[u][v]) {
      es.emplace_back(u, v);
      es.emplace_back(v, u);
    }
    sort(es.begin(), es.end(), [&](const pair<int, int> &e0, const pair<int, int> &e1) -> bool {
      const Pt dir0 = P[e0.second] - P[e0.first];
      const Pt dir1 = P[e1.second] - P[e1.first];
      const int res = cmpArg(dir0, dir1);
      if (res) return (res < 0);
      return (dir0.dot(P[e0.first]) < dir0.dot(P[e1.first]));
    });
    
    const int esLen = es.size();
    memset(ids, ~0, sizeof(ids));
    for (int i = 0; i < esLen; ++i) {
      const int u = es[i].first;
      const int v = es[i].second;
      ids[u][v] = i;
    }
    
    memset(dp, 0, sizeof(dp));
    for (int l = N; --l >= 0; ) for (int r = l + 1; r < N; ++r) {
      if (~ids[r][l]) {
        vector<Int> sub(N, -INF);
        sub[l] = P[r].det(P[l]) + W + C;
        auto adv = [&](int i) -> void {
          const int u = es[i].first;
          const int v = es[i].second;
          if (u < v && !(u == l && v == r)) {
            const Int score = dp[u + 1][v - 1] + P[u].det(P[v]) + W;
            chmax(sub[v], sub[u] + score);
          }
        };
        for (int i = ids[r][l]; i < esLen; ++i) adv(i);
        for (int i = 0; i < ids[r][l]; ++i) adv(i);
        chmax(dp[l][r], sub[r]);
      }
      chmax(dp[l][r], dp[l + 1][r]);
      chmax(dp[l][r], dp[l][r - 1]);
      for (int m = l; m < r; ++m) {
        chmax(dp[l][r], dp[l][m] + dp[m + 1][r]);
      }
    }
    
    printf("%lld\n", dp[0][N - 1]);
  }
  return 0;
}