#include <iostream>
#include <algorithm>
#include <unordered_map>
#include <vector>
using namespace std;

inline int calc_score(int stars, int users) {
  return 50 * stars + (500 * stars) / (8 + 2 * (users + 1));
}

int main() {
  int N, T;
  cin >> N;
  vector<int> L(N);
  for(int i = 0; i < N; i++) cin >> L[i];
  cin >> T;
  vector<string> names;
  unordered_map<string, int> name_to_id;
  vector<int> id, query;
  for(int i = 0; i < T; i++) {
    string name, P;
    cin >> name >> P;
    if(!name_to_id.count(name)) {
      name_to_id[name] = names.size();
      names.push_back(name);
    }
    id.push_back(name_to_id[name]);
    query.push_back(P == "?" ? -1 : P[0] - 'A');
  }
  vector<int> score(names.size());
  vector<vector<int>> score2(names.size(), vector<int>(N));
  vector<int> solved(N);
  for(int i = 0; i < T; i++) {
    if(query[i] == -1) continue;
    score[id[i]] = (score[id[i]] / T + calc_score(L[query[i]], solved[query[i]])) * T + T - i - 1;
    score2[id[i]][query[i]] = calc_score(L[query[i]], solved[query[i]]);
    solved[query[i]]++;
  }
  vector<pair<int, int>> tmp;
  for(int i = 0; i < score.size(); i++) {
    tmp.emplace_back(-score[i], i);
  }
  sort(tmp.begin(), tmp.end());
  for(int i = 0; i < tmp.size(); i++) {
    cout << i + 1 << " " << names[tmp[i].second];
    for(int j = 0; j < N; j++) {
      cout << " " << score2[tmp[i].second][j];
    }
    cout << " " << -tmp[i].first / T << endl;
  }

}