#include<bits/stdc++.h>
using namespace std;
using ll=long long;
template<typename T>
ostream& operator << (ostream &out,const vector<T>&x){
	if(x.empty())return out<<"[]";
	out<<'['<<x[0];
	for(int len=x.size(),i=1;i<len;i++)out<<','<<x[i];
	return out<<']';
}
template<typename T>
ostream& operator << (ostream &out,const pair<T,T>&x){
	return out<<'['<<x.first<<','<<x.second<<']';
}
template<typename T>
vector<T> ary(const T *a,int l,int r){
	return vector<T>{a+l,a+1+r};
}
template<typename T>
void debug(T x){
	cerr<<x<<'\n';
}
template<typename T,typename ...S>
void debug(T x,S ...y){
	cerr<<x<<' ',debug(y...);
}
const int N=55,Inf=1e9;
const ll INF=1e18;
namespace Flow{
	const int V=N*2,E=N*2*2+N*N*2;
	int s,t,kk,head[V],d[V],cur[V];
	struct edges{
		int to;
		ll c;
		int nex;
	}edge[E];
	void init(int x,int y){
		s=x,t=y,kk=1;
		fill(head+s,head+1+t,0);
	}
	int add(int u,int v,ll c){
		// debug(u,v,c);
		edge[++kk]={v,c,head[u]},head[u]=kk;
		edge[++kk]={u,0,head[v]},head[v]=kk;
		return kk-1;
	}
	bool bfs(){
		queue<int>q;
		q.push(s);
		copy(head+s,head+1+t,cur+s);
		fill(d+s,d+1+t,-1),d[s]=0;
		for(int u;!q.empty();){
			u=q.front(),q.pop();
			for(int i=head[u];i;i=edge[i].nex){
				int v=edge[i].to;
				if(edge[i].c&&!~d[v])d[v]=d[u]+1,q.push(v);
			}
		}
		return ~d[t];
	}
	ll dfs(int u,ll lim=INF){
		if(u==t)return lim;
		ll flow=0;
		for(int i=cur[u];i&&flow<lim;i=edge[i].nex){
			cur[u]=i;
			int v=edge[i].to;
			ll c=edge[i].c;
			if(!c||d[v]!=d[u]+1)continue;
			ll f=dfs(v,min(lim-flow,c));
			if(!f)d[v]=-1;
			edge[i].c-=f,edge[i^1].c+=f,flow+=f;
		}
		return flow;
	}
	ll dinic(){
		ll flow=0;
		for(;bfs();)flow+=dfs(s);
		return flow;
	}
}
const int ax[4]={1,1,-1,-1},ay[4]={1,-1,-1,1};
int n,R,G,P,a[N];
struct vec{
	int x,y,arg;
}p[N];
vector<pair<int,int> >E;
ll solve(){
	ll ans=1ll*E.size()*G;
	int s=0,t=n+n+1;
	Flow::init(s,t);
	// debug(ary(a,1,n));
	for(int i=1;i<=n;i++)Flow::add(s,i,Inf-a[i]*P);
	for(int i=1;i<=n;i++)Flow::add(i+n,t,Inf+a[i]*P);
	for(int i=1;i<=n;i++)Flow::add(i,i+n,INF);
	for(auto e:E){
		int u,v;
		tie(u,v)=e;
		Flow::add(u,v+n,G*4);
	}
	ll res=Flow::dinic();
	// debug(ans,res);
	return ans-res+1ll*Inf*n;
}
int main(){
	cin>>n>>R>>G>>P;
	for(int i=1;i<=n;i++)cin>>p[i].x>>p[i].y>>p[i].arg;
	for(int i=1;i<=n;i++){
		for(int j=1;j<=n;j++){
			int dx=p[i].x-p[j].x,dy=p[i].y-p[j].y;
			if(!dx||!dy)continue;
			if(dx*dx+dy*dy<=R*R)E.push_back({i,j});
		}
	}
	// debug(E);
	ll ans=0;
	for(int i=1;i<=n;i++)a[i]=ax[p[i].arg/90];
	ans+=solve();
	for(int i=1;i<=n;i++)a[i]=ay[p[i].arg/90];
	ans+=solve();
	cout<<ans/2<<endl;
	return 0;
}