#include <iostream>
#include <algorithm>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <numeric>
#include <bitset>
#include <cmath>

static const int MOD = 1000000007;
using ll = long long;
using u32 = unsigned;
using u64 = unsigned long long;
using namespace std;

template<class T> constexpr T INF = ::numeric_limits<T>::max()/32*15+208;

int main() {
    array<int, 6> as{60, 80, 100, 120, 140, 160}, bs{2, 5, 10, 15, 20, 25}, ps{600, 800, 1000, 1200, 1400, 1600};
    int n;
    while(cin >> n, n){
        int ans = 0;
        for (int i = 0; i < n; ++i) {
            int a, b, c, d;
            cin >> a >> b >> c >> d;
            for (int j = 0; j < 6; ++j) {
                if(a+b+c <= as[j] && d <= bs[j]){
                    ans += ps[j];
                    break;
                }
            }
        }
        cout << ans << "\n";
    }
    return 0;
}
