#include <iostream>
#include <iomanip>
#include <vector>
#include <algorithm>
#include <numeric>
#include <functional>
#include <cmath>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <sstream>
#include <string>
#define _repargs(_1,_2,_3,name,...) name
#define _rep(i,n) repi(i,0,n)
#define repi(i,a,b) for(int i=(int)(a);i<(int)(b);++i)
#define rep(...) _repargs(__VA_ARGS__,repi,_rep,)(__VA_ARGS__)
#define all(x) (x).begin(),(x).end()
#define mod 1000000007
#define inf 5000
#define mp make_pair
#define pb push_back
typedef long long ll;
using namespace std;
template <typename T>
inline void output(T a, int p = 0) {
    if(p) cout << fixed << setprecision(p)  << a << "\n";
    else cout << a << "\n";
}

template <typename T> inline void voutput(T &v){
    rep(i, v.size()){
        if (i) cout << " " << v[i];
        else cout << v[i];
    }
//    cout << endl;
}
// end of template

int main() {
    cin.tie(0);
    ios::sync_with_stdio(0);
    // source code
    int N;
    cin >> N;
    vector<int> L(N);
    vector<int> P(N, 1);
    rep(i, N) cin >> L[i];
    int T;
    cin >> T;
    map<string, vector<int>> M;
    vector<int> V(N);
    vector<pair<string, int>> A(T);
    rep(i, T){
        string s;
        char c;
        cin >> s >> c;
        M[s] = V;
        A[i] = mp(s, c - 'A');
    }
    
    map<string, int> I;
    map<int, string> S;
    int cnt = 0;
    for(auto m : M){
        I[m.first] = cnt;
        S[cnt] = m.first;
        cnt++;
    }
    
    // 点数、回答タイミング、id(I)
    vector<pair<pair<int, int>, int>> R;
    for(auto i : I){
        R.pb(mp(mp(0, inf), i.second));
    }
    
    rep(i, T){
        string s = A[i].first;
        int n = A[i].second;
        M[s][n] = 50 * L[n] + (50 * L[n]) / (0.8 + 0.2 * P[n]);
        P[n]++;
        R[I[s]].first = mp(R[I[s]].first.first + M[s][n], inf - i);
    }
    
    sort(all(R));
    reverse(all(R));
    
    rep(i, R.size()){
        cout << i + 1 << " " << S[R[i].second] << " ";
        voutput(M[S[R[i].second]]);
        cout << " " << R[i].first.first << endl;
    }
    
    
    
    
    return 0;
}