COJ 1358

/*
    By: Luchomatic
    From: La Plata Buenos Aires Argentina
    Name: Luciano Castro
    Date: 21/09/2014
*/

#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <string>
#include <cstring>
#include <cmath>
#include <algorithm>
#include <vector>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <iterator>
#include <utility>
#include <list>
#include <stack>
#include <iomanip>


#define MAX_INT 2147483647
#define MAX_LONG 9223372036854775807ll
#define MAX_ULONG 18446744073709551615ull
#define MAX_DBL 1.7976931348623158e+308
#define EPS 1e-9
#define _log2(x) log(x) * 1.44269504088896340736
//const long double PI = 2*acos(0);

#define INF 1000000000

int n, naux;
char s[1000];
char smax[1000];
char smin[1000];
int maxi, mini, total;
int a[5], i;

int main () {
    scanf ("%d", &n);
    mini=99999;
    maxi=-1;
    while (n!=-1){
        while (n--){
            scanf ("%s", &s);
            scanf ("%d", &a[0]);
            scanf ("%d", &a[1]);
            scanf ("%d", &a[2]);
            total=((a[0]*5)+(a[1]*10)+(a[2]*20));
            if (total>maxi){
                maxi=total;
                smax=s;
            }
            if (total<mini){
                mini=total;
                smin=s;
            }
        }
        if (mini==maxi){
            printf("All have the same amount.\n");
        }else{
            printf ("%s has most, ", smax);
            printf ("%s has least money.\n", smin);
        }
    scanf ("%d", &n);
    mini=99999;
    maxi=-1;
    }
}