#include <bits/stdc++.h>
using namespace std;
#define FOR(i, s, n) for(int i = s; i < (int)n; i++)
#define per(i, n) for(int i = n; i >= 0; i--)
#define ROF(i, s, n) for(int i = s; i >= (int)n; i--)
#define FORIT(i, A) for (auto i : A)
#define PRINT(x) cout << (x) << "\n"
#define ALL(a) (a).begin(),(a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define MP make_pair
#define EACH(i, n) for (__typeof((n).begin()) i = (n).begin(); i != (n).end(); ++i)
#define SZ(a) int((a).size())
#define EXIST(s,e) ((s).find(e)!=(s).end())
#define SORT(c) sort((c).begin(),(c).end())
#define CLR(a) memset((a), 0 ,sizeof(a))
#define NCLR(a) memset((a), -1 ,sizeof(a))
#define dump(x) cout << #x << " = " << (x) << "\n";
#define debug(x) cout << #x << " = " << (x) << " (L" << __LINE__ << ")" << " " << __FILE__ << "\n";
#define sq(n) (n) * (n)
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef long long LL;
typedef vector<LL> VLL;
typedef vector<VLL> VVLL;
typedef unsigned int uint;
typedef unsigned long long ull;
typedef priority_queue<int> maxpq;
typedef priority_queue< int, vector<int>, greater<int> > minpq;
static const double EPS = 1e-10;
static const double PI = acos( -1.0 );
static const int mod = 1000000007;
static const int INF = 1 << 25;
static const LL LL_INF = 1152921504606846976;
static const int dx[] = { -1, 0, 1, 0, 1, -1, 1, -1 };
static const int dy[] = { 0, -1, 0, 1, 1, 1, -1, -1 };

int n;
int ans, x, y, h, w;
int _size;


int main() {
	while ( ~scanf( "%d", &n ) && n ) {
		ans = 0;
		for ( int i = 0; i < n; i++ ) {
			scanf( "%d %d %d %d", &x, &y, &h, &w );
			_size = x + y + h;
			if ( _size <= 60 && w <= 2 ) {
				ans += 600;
			}
			else if ( _size <= 80 && w <= 5 ) {
				ans += 800;
			}
			else if ( _size <= 100 && w <= 10 ) {
				ans += 1000;
			}
			else if ( _size <= 120 && w <= 15 ) {
				ans += 1200;
			}
			else if ( _size <= 140 && w <= 20 ) {
				ans += 1400;
			}
			else if ( _size <= 160 && w <= 25 ) {
				ans += 1600;
			}
		}
		printf( "%d\n", ans );
	}

	return 0;
}