#include <bits/stdc++.h>
using namespace std;
/*{{{*/  //template
#define REP(i,n) for(int i=0;i<n;i++)
#define rep(i,n) for(int i=0;i<n;i++)
#define INF 1<<29
#define LINF LLONG_MAX/3
#define MP make_pair
#define PB push_back
#define EB emplace_back
#define ALL(v) (v).begin(),(v).end()
#define all(v) ALL(v)
#define debug(x) cerr<<#x<<":"<<x<<endl
#define debug2(x,y) cerr<<#x<<","<<#y":"<<x<<","<<y<<endl
#define CININIT cin.tie(0),ios::sync_with_stdio(false)
template<typename T> ostream& operator<<(ostream& os,const vector<T>& vec){ os << "["; for(const auto& v : vec){ os << v << ","; } os << "]"; return os; }
template<typename T,typename U> ostream& operator<<(ostream& os,const pair<T,U>& p){ os << "(" << p.first << ","<< p.second <<")"; return os; }
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef vector<vi> vvi;
ll gcd(ll a,ll b){ if(b==0) return a; else return gcd(b,a%b); }

constexpr ll mod = 1e9+7;
const int dx[]={1,0,-1,0} ,dy[] = {0,1,0,-1};
/*}}}*/

int main(){
    int N;cin>>N;
    vector<int> L(N);
    rep(i,N) cin>>L[i];
    int T;cin>>T;
    vector<string> names(T);
    vector<char> ps(T);
    rep(i,T) cin>>names[i]>>ps[i];

    map<string,vector<int>> hoge;
    map<string,int> mp;
    vector<int> cnt(N,0);

    map<string,map<int,int>> score;

    set<string> st;
    map<string,int> ls;
    rep(i,T){
        string n = names[i];
        st.insert(n);
        int idx = ps[i]-'A';
        int star = L[idx];
        cnt[idx]++;
        int acn = cnt[idx];

        int point = 50 * star + (50 * star / (0.8 + 0.2*acn));
        score[n][idx] = point;

        hoge[n].push_back(point);
        ls[n] = i;
    }


    using P = pair<int,pair<int,string>>;
    vector<P> vp;
    for(auto a : hoge){
        string name = a.first;
        auto v = a.second;
        int sum = 0;
        for(int i=0;i<v.size();i++) sum += v[i];
        //vp.push_back(P(sum,-ls[name],name));
        vp.push_back(MP(sum,MP(-ls[name],name)));
    }

    sort(all(vp));
    reverse(all(vp));

    for(int i=0;i<vp.size();i++){
        string name = vp[i].second.second;

        cout << i + 1 << " " << name << " ";
        auto v = score[name];
        for(int j=0;j<N;j++) cout << v[j] << " ";

        cout << vp[i].first << endl;
    }

    assert(st.size()==vp.size());
}