#include <bits/stdc++.h>
using namespace std;
using i64 = long long;
using ll = long long;
#define pb emplace_back
#define X first
#define Y second
#define AI(i) begin(i), end(i)
template<class T> bool chmax(T &a, T b) { return a < b && (a = b, true);}
template<class T> bool chmin(T &a, T b) { return b < a && (a = b, true);}
#ifdef KEV
#define DE(args...) kout("[ " + string(#args) + " ] = ", args)
void kout() { cerr << endl; }
template<class T, class ...U> void kout(T a, U ...b) { cerr << a << ' ', kout(b...); }
template<class T> void debug(T l, T r) { while (l != r) cerr << *l++ << " \n"[l==r]; }
#else
#define DE(...) 0
#define debug(...) 0
#endif

template <typename F>
struct Flow {
	static constexpr F INF = numeric_limits<F>::max() / 2;
	struct Edge {
		int to;
		F cap;
		Edge(int to, F cap) : to(to), cap(cap) {}
	};
	int n;
	vector<Edge> e;
	vector<vector<int>> adj;
	vector<int> cur, h;
	Flow(int n) : n(n), adj(n) {}
	bool bfs(int s, int t) {
		h.assign(n, -1);
		queue<int> q;
		h[s] = 0;
		q.push(s);
		while (!q.empty()) {
			int u = q.front();
			q.pop();
			for (int i : adj[u]) {
				auto [v, c] = e[i];
				if (c > 0 && h[v] == -1) {
					h[v] = h[u] + 1;
					if (v == t) { return true; }
					q.push(v);
				}
			}
		}
		return false;
	}
	F dfs(int u, int t, F f) {
		if (u == t) { return f; }
		F r = f;
		for (int &i = cur[u]; i < int(adj[u].size()); i++) {
			int j = adj[u][i];
			auto [v, c] = e[j];
			if (c > 0 && h[v] == h[u] + 1) {
				F a = dfs(v, t, min(r, c));
				e[j].cap -= a;
				e[j ^ 1].cap += a;
				r -= a;
				if (r == 0) { return f; }
			}
		}
		return f - r;
	}
	void addEdge(int u, int v, F cf = INF, F cb = 0) {
		adj[u].push_back(e.size()), e.emplace_back(v, cf);
		adj[v].push_back(e.size()), e.emplace_back(u, cb);
	}
	F maxFlow(int s, int t) {
		F ans = 0;
		while (bfs(s, t)) {
			cur.assign(n, 0);
			ans += dfs(s, t, INF);
		}
		return ans;
	}
};

const int MAX_N = 300010;
int main() {
	ios_base::sync_with_stdio(0), cin.tie(0);

	int n, R, G, P;
	cin >> n >> R >> G >> P;
	G *= 2;

	vector<int> x(n), y(n), d(n);
	for (int i = 0; i < n; i++) {
		cin >> x[i] >> y[i] >> d[i];
		d[i] /= 90;
		if (d[i] % 4 >= 2) {
			d[i] ^= 1;
		}
	}

	vector<pair<int, int>> pairs;
	for (int i = 0; i < n; i++) {
		for (int j = i + 1; j < n; j++) {
			if (x[i] != x[j] && y[i] != y[j] && (x[i] - x[j]) * (x[i] - x[j]) + (y[i] - y[j]) * (y[i] - y[j]) <= R * R) {
				pairs.emplace_back(i, j);
			}
		}
	}

	int ans = G * int(pairs.size()) + P * n;

	int S = 2 * n, T = S + 1;

	for (int b = 0; b < 2; b++) {
		Flow<int> mf(T + 1);
		for (int i = 0; i < n; i++) {
			int x = d[i] >> b & 1;
			mf.addEdge(S, 2 * i, x == 0 ? 0 : P);
			mf.addEdge(2 * i + 1, T, x == 1 ? 0 : P);
		}
		for (auto [u, v] : pairs) {
			mf.addEdge(2 * u, 2 * v + 1, G);
			mf.addEdge(2 * v, 2 * u + 1, G);
		}
		ans -= mf.maxFlow(S, T);
	}

	cout << ans << '\n';
}