#include "bits/stdc++.h"
#define rep(i,n) for(int i = 0;i < n;i++)
#define REP(i,n,k) for(int i = n;i < k;i++)
#define P(p) cout << (p) << endl;
#define sP(p) cout << setprecision(15) << fixed << p << endl;
#define vi vector<int>
#define mp(a,b) make_pair(a,b)
using namespace std; typedef long long ll; typedef unsigned long long ull; int dx[] = { 1, -1 , 0 , 0 }; int dy[] = { 0,  0,  1, -1 };

bool comp(pair<pair<int,int>,string> p1,pair<pair<int,int>,string> p2){
  if(p1.first.first == p2.first.first){
    return p1.first.second > p2.first.second;
  }else{
    return p1.first.first < p2.first.first;
  }
}

void solve() {
  int n;
  cin >> n;
  vi l(n), ac(n, 1);
  map<string, vector<int> > names;
  map<string,int> last;
  rep(i, n)cin >> l[i];
  int t;
  cin >> t;
  rep(i, t) {
    string name;
    char mon;
    cin >> name >> mon;
    int tmp = mon - 'A';
    if (names.find(name) == names.end()) {
      rep(j, 26) {
	names[name].push_back(0);
      }
    }
    names[name][tmp] = (int)(l[tmp]*50 + (double)(50*l[tmp] / (0.8 + (0.2*ac[tmp]))));
    last[name] = i+1;
    ac[tmp]++;
  }
  vector<pair<pair<int, int>,string > > v;
  for (map<string,vector<int> >::iterator it = names.begin(); it != names.end(); it++) {
    int sum = 0;
    rep(i, 26) {
      sum += it->second[i];
    }
    v.push_back(make_pair(make_pair(sum, last[it->first]),it->first));
  }
  sort(v.begin(), v.end(),comp);
  reverse(v.begin(),v.end());
  rep(i, v.size()) {
    cout << i + 1 << " " << v[i].second << " ";
    rep(j, n) {
      cout << names[v[i].second][j] << " ";
    }
    cout << v[i].first.first << endl;
  }
}

int main() {
  solve();
  return 0;
}