#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

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

int n, a, b, c;
vector < pair<ll,string> > v;
string s;

int main(){
	bool f = 0;
	while (cin >> n&&n){
		REP(i, n){
			cin >> s >> a >> b >> c;
			v.push_back(make_pair(a * 3 + c, s));
		}
		REP(i, v.size()-1){
			if (v[i].first < v[i+1].first){
				swap(v[i], v[i + 1]);
			}
		}
		if (f)cout << " " << endl;
		REP(i, v.size()){
			cout << v[i].second << "," << v[i].first << endl;
		}
		f = 1;
		v.clear();
	}
}