#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <functional>
#include <numeric>
#include <stack>
#include <queue>
#include <map>
#include <set>
#include <utility>
#include <sstream>
#include <complex>

using namespace std;

#define FOR(i,a,b) for(long long i=(a);i<(b);i++)
#define REP(i,N) for(long long i=0;i<(N);i++)
#define ALL(s) (s).begin(),(s).end()
#define fi first
#define se second

#define PI acos(-1.0)
#define INF 1000000007
#define EPS 1e-10
#define MAX_M 100100

typedef long long ll;
typedef pair<ll, ll> P;
typedef pair<double, double> PD;
typedef pair<string, ll> PS;
typedef vector<ll> V;
typedef pair<P, char> PC;

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

int main(){
	while (cin >> n&&n){
		int ans = 0;
		REP(i, n){
			cin >> x >> y >> h >> w;
			int 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;
		}
		cout << ans << endl;
	}
}