import java.io.FileNotFoundException;
import java.io.IOException;
import java.io.InputStream;
import java.util.Arrays;
import java.util.Comparator;
import java.util.HashMap;
import java.util.HashSet;
import java.util.NoSuchElementException;

public class Main {
	public static void main(String[] args) throws FileNotFoundException {
		long t = System.currentTimeMillis();
		new Main().run();
		System.err.println(System.currentTimeMillis() - t);
	}
	
	void run() {
		FastScanner sc = new FastScanner();
		HashSet<Integer> set=new HashSet<>();
		int N=sc.nextInt();
		int[] level=new int[N];
		for(int i=0;i<N;++i)level[i]=sc.nextInt();
		int T=sc.nextInt();
		String[] name=new String[T];
		String[] ref=new String[T];
		int[] problem=new int[T];
		HashMap<String,Integer> id=new HashMap<String, Integer>();
		int p=0;
		for(int i=0;i<T;++i) {
			name[i]=sc.next();
			problem[i]=(int)(sc.next().charAt(0)-'A');
			if(!id.containsKey(name[i])) {
				id.put(name[i], p);
				ref[p++]=name[i];
			}
		}
		int[][] state=new int[id.size()][3+N];//sum,last,id,
		int[] sz=new int[N];
		for(int i=0;i<state.length;++i) {
			state[i][2]=i;
		}
		for(int i=0;i<T;++i) {
			state[id.get(name[i])][1]=i;
			sz[problem[i]]++;
			state[id.get(name[i])][0]+=50*level[problem[i]]+250*level[problem[i]]/(4+sz[problem[i]]);
			state[id.get(name[i])][3+problem[i]]+=50*level[problem[i]]+250*level[problem[i]]/(4+sz[problem[i]]);
		}
		Arrays.sort(state, new Comparator<int[]>() {
			@Override
			public int compare(int[] o1, int[] o2) {
				return -Long.compare(((long)o1[0])<<32|(T-o1[1]), ((long)o2[0])<<32|(T-o2[1]));
			}
		});
		for(int i=0;i<state.length;++i) {
			System.out.print((i+1)+" "+ref[id.get(name[state[i][2]])]+" ");
			for(int j=0;j<N;++j)System.out.print(state[i][3+j]+" ");
			System.out.println(state[i][0]);
		}
		
	}

	
	static void tr(Object... objects) {
		System.out.println(Arrays.deepToString(objects));
	}

}
	
	
class FastScanner {
    private final InputStream in = System.in;
    private final byte[] buffer = new byte[1024];
    private int ptr = 0;
    private int buflen = 0;
    private boolean hasNextByte() {
        if (ptr < buflen) {
            return true;
        }else{
            ptr = 0;
            try {
                buflen = in.read(buffer);
            } catch (IOException e) {
                e.printStackTrace();
            }
            if (buflen <= 0) {
                return false;
            }
        }
        return true;
    }
    private int readByte() { if (hasNextByte()) return buffer[ptr++]; else return -1;}
    private static boolean isPrintableChar(int c) { return 33 <= c && c <= 126;}
    private void skipUnprintable() { while(hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++;}
    public boolean hasNext() { skipUnprintable(); return hasNextByte();}
    public String next() {
        if (!hasNext()) throw new NoSuchElementException();
        StringBuilder sb = new StringBuilder();
        int b = readByte();
        while(isPrintableChar(b)) {
            sb.appendCodePoint(b);
            b = readByte();
        }
        return sb.toString();
    }
    public long nextLong() {
        if (!hasNext()) throw new NoSuchElementException();
        long n = 0;
        boolean minus = false;
        int b = readByte();
        if (b == '-') {
            minus = true;
            b = readByte();
        }
        if (b < '0' || '9' < b) {
            throw new NumberFormatException();
        }
        while(true){
            if ('0' <= b && b <= '9') {
                n *= 10;
                n += b - '0';
            }else if(b == -1 || !isPrintableChar(b)){
                return minus ? -n : n;
            }else{
                throw new NumberFormatException();
            }
            b = readByte();
        }
    }
    
    public int nextInt() {
    	return (int)nextLong();
    }
}