#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

typedef int _loop_int;
#define REP(i,n) for(_loop_int i=0;i<(_loop_int)(n);++i)
#define FOR(i,a,b) for(_loop_int i=(_loop_int)(a);i<(_loop_int)(b);++i)
#define FORR(i,a,b) for(_loop_int i=(_loop_int)(b)-1;i>=(_loop_int)(a);--i)

#define DEBUG(x) cout<<#x<<": "<<x<<endl
#define DEBUG_VEC(v) cout<<#v<<":";REP(i,v.size())cout<<" "<<v[i];cout<<endl
#define ALL(a) (a).begin(),(a).end()

#define CHMIN(a,b) a=min((a),(b))
#define CHMAX(a,b) a=max((a),(b))

// mod
const ll MOD = 1000000007ll;
#define FIX(a) ((a)%MOD+MOD)%MOD

// floating
typedef double Real;
const Real EPS = 1e-11;
#define EQ0(x) (abs(x)<EPS)
#define EQ(a,b) (abs(a-b)<EPS)
typedef complex<Real> P;

int n;
int a[252];
int b[252];

int calc(int a,int b){
  return 50*a+(int)((500*a)/(8+2*b));
}

int main(){
  scanf("%d",&n);
  REP(i,n)scanf("%d",a+i);
  REP(i,n)b[i] = 1;
  map<string,vi> sc;
  int t;
  scanf("%d",&t);
  while(t--){
    string nm;
    string p;
    cin>>nm>>p;
    int id = p[0]-'A';
    if(!sc.count(nm)){
      sc[nm] = vi(n+1,0);
    }
    sc[nm][id] = calc(a[id],b[id]);
    sc[nm][n] = t;
    b[id]++;
  }
  vector< pair<pii, pair<string,vi>>> vec;
  for(auto P:sc){
    string name = P.first;
    vi scores = P.second;
    int sum = 0;
    REP(i,n)sum+=scores[i];
    pii id = pii(sum,scores[n]);
    vec.push_back(make_pair(id,make_pair(name,scores)));
  }
  sort(ALL(vec));
  reverse(ALL(vec));
  REP(i,vec.size()){
    int sum = vec[i].first.first;
    string name = vec[i].second.first;
    vi scores = vec[i].second.second;
    printf("%d %s ",i+1,name.c_str());
    REP(i,n)printf("%d ",scores[i]);
    printf("%d\n",sum);
  }
  return 0;
}