#include<bits/stdc++.h>
using namespace std;

const int Max=4e3+20,nmax=2e3+5;
int Map[Max*2][Max*2],lm[Max*2][Max*2],ch[6];
int n;
double ans;
int main()
{
	scanf("%d",&n);
	int op,x,y,a;
	for(int i=1;i<=n;i++)
	{
		scanf("%d%d%d%d",&op,&x,&y,&a);
		if(op==0)
		{
			Map[(x-a/2+nmax)*2][(y+a/2+nmax)*2]+=1;
			Map[(x-a/2+nmax)*2][(y-a/2+nmax)*2]-=1;
			Map[(x+a/2+nmax)*2][(y+a/2+nmax)*2]-=1;
			Map[(x+a/2+nmax)*2][(y-a/2+nmax)*2]+=1;
		}
		else
		{
			lm[(x-a/2+nmax)*2][(y+nmax)*2]+=1;
			lm[(x+nmax)*2][(y+a/2+nmax)*2]-=1;
			lm[(x+nmax)*2][(y-a/2+nmax)*2]-=1;
			lm[(x+a/2+nmax)*2][(y+nmax)*2]+=1;
		}
	}
	for(int i=5;i<=nmax*4;i++)
	{
		for(int j=nmax*4;j>=5;j--)
		{
			Map[i][j]=Map[i][j]+Map[i-1][j]+Map[i][j+1]-Map[i-1][j+1];
			lm[i][j]=lm[i][j]+lm[i-1][j+1]+lm[i-1][j-1]-lm[i-2][j];
		}
	}
	for(int i=5;i<=nmax*4;i++)
	{
		for(int j=nmax*4;j>=5;j--)
		{
			if(Map[i][j]){ans+=0.25;continue;}
			if(lm[i][j])
				ch[1]=ch[2]=1;
			if(lm[i-1][j-1])ch[3]=ch[4]=1;
			if(lm[i][j-1])ch[2]=ch[3]=1;
			if(lm[i-1][j])ch[1]=ch[4]=1;
			for(int k=1;k<=4;k++)
			{
				if(ch[k])ans+=0.0625;
				ch[k]=0;
			}
		}
	}
	
	printf("%.2lf",ans);
}