#include <bits/stdc++.h>

using namespace std;

#define fir first
#define sec second
#define mkp make_pair 
#define pb push_back
#define lep( i, l, r ) for ( int i = ( l ); i <= ( r ); ++ i )
#define rep( i, r, l ) for ( int i = ( r ); i >= ( l ); -- i )

typedef long long ll;
typedef long double ld;
typedef pair < int, int > pii;

char _c; bool _f; template < class type > inline void read ( type &x ) {
	_f = 0, x = 0;
	while ( _c = getchar (), !isdigit ( _c ) ) if ( _c == '-' ) _f = 1;
	while ( isdigit ( _c ) ) x = x * 10 + _c - '0', _c = getchar (); if ( _f ) { x = -x; }
}

template < class type > inline void chkmin ( type &x, type y ) { x = ( x <= y ? x : y ); }
template < class type > inline void chkmax ( type &x, type y ) { x = ( x >= y ? x : y ); }

const int N = 1e5 + 5;
const int M = 4015;

int n, ans;
int pre1[M][M], pre2[M << 1][M << 1];
int p[4][M][M];

void add1 ( int x1, int y1, int x2, int y2 ) {
  pre1[x1 + 2001][y1 + 2001] ++, pre1[x1 + 2001][y2 + 2001] --, pre1[x2 + 2001][y1 + 2001] --, pre1[x2 + 2001][y2 + 2001] ++;
}

void add2 ( int x1, int y1, int x2, int y2 ) {
  pre2[x1 + 4002][y1 + 4002] ++, pre2[x1 + 4002][y2 + 4002] --, pre2[x2 + 4002][y1 + 4002] --, pre2[x2 + 4002][y2 + 4002] ++;
}

void Solve () {
  ios :: sync_with_stdio ( false );
  cin.tie ( 0 ), cout.tie ( 0 );
  cin >> n;
  for ( int i = 1; i <= n; i ++ ) {
    int op, x, y, r;
    cin >> op >> x >> y >> r;
    r >>= 1;
    if ( !op ) {
      add1 ( x - r, y - r, x + r, y + r );
    }
    else {
      int tmpx = x, tmpy = y;
      x = tmpx + tmpy, y = tmpx - tmpy;
      add2 ( x - r, y - r, x + r, y + r );
    }
  }
  for ( int i = 0; i <= 4002; i ++ ) {
    for ( int j = 0; j <= 4002; j ++ ) {
      if ( !i && !j ) {
        continue;
      }
      else if ( !i ) {
        pre1[i][j] += pre1[i][j - 1];
      }
      else if ( !j ) {
        pre1[i][j] += pre1[i - 1][j];
      }
      else {
        pre1[i][j] += pre1[i - 1][j] + pre1[i][j - 1] - pre1[i - 1][j - 1];
      }
    }
  }
  for ( int i = 0; i <= 8004; i ++ ) {
    for ( int j = 0; j <= 8004; j ++ ) {
      if ( !i && !j ) {
        continue;
      }
      else if ( !i ) {
        pre2[i][j] += pre2[i][j - 1];
      }
      else if ( !j ) {
        pre2[i][j] += pre2[i - 1][j];
      }
      else {
        pre2[i][j] += pre2[i - 1][j] + pre2[i][j - 1] - pre2[i - 1][j - 1];
      }
    }
  }
  for ( int i = 0; i <= 4002; i ++ ) {
    for ( int j = 0; j <= 4002; j ++ ) {
      if ( pre1[i][j] ) {
        p[0][i][j] = p[1][i][j] = p[2][i][j] = p[3][i][j] = 1;
      }
    }
  }
  for ( int i = 0; i <= 8004; i ++ ) {
    for ( int j = 0; j <= 8004; j ++ ) {
      if ( pre2[i][j] ) {
        int tmpx = ( i + j ) >> 1, tmpy = ( i - j ) >> 1;
        if ( i + j & 1 ) {
          p[0][tmpx + 1 - 2001][( i - j - 1 ) / 2 + 2001] = p[1][tmpx - 2001][( i - j - 1 ) / 2 + 2001] = 1;
        }
        else {
          p[2][tmpx - 2001][tmpy + 2001] = p[3][tmpx - 2001][tmpy + 2001 - 1] = 1;
        }
      }
    }
  }
  for ( int i = 0; i <= 4002; i ++ ) {
    for ( int j = 0; j <= 4002; j ++ ) {
      ans += p[0][i][j] + p[1][i][j] + p[2][i][j] + p[3][i][j];
    }
  }
  cout << fixed << setprecision ( 2 ) << ans / 4.0;
}

signed main () {
#ifdef judge
  freopen ( "Code.in", "r", stdin );
  freopen ( "Code.out", "w", stdout );
  freopen ( "Code.err", "w", stderr );
#endif
  Solve ();
  return 0;
}