#include <bits/stdc++.h>
#define FOR(i,a,b) for (int i=(a);i<(b);i++)
#define FORR(i,a,b) for (int i=(a);i>=(b);i--)
#define pb push_back
#define pcnt __builtin_popcount
#define show(x) cout<<#x<<" = "<<x<<endl;
#define maxs(x,y) x = max(x,y)
#define mins(x,y) x = min(x,y)
#define fi first
#define se second
#define rng(a) a.begin(),a.end()
#define each(it,c) for(__typeof((c).begin()) it=(c).begin();it!=(c).end();it++)
#define sz(x) (int)(x).size()
#define mp make_pair

using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<pii> vpii;
typedef set<int> si;
typedef pair<ll,ll> pll;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<pll> vpll;
typedef set<ll> sl;
template<typename T>string join(vector<T>&v)
{stringstream s;FOR(i,0,sz(v))s<<' '<<v[i];return s.str().substr(1);}
ll gcd(ll a,ll b){if(a>b)swap(a,b);for(;a>0;b%=a,swap(a,b));return b;}
int modpow(ll a,ll n,int m){if(a==0)return a;ll p=1;for(;n>0;n/=2,a=a*a%m)if(n&1)p=p*a%m;return(int)p;}
void dout(double d){printf("%.12f\n",d);}

const int iinf = 1e9;
const ll linf = 1e18;
const int mod = 1e9+7;

int n, t, ac[26], l[26];
map<string, vi > m;
string s;
char p;
main(){
  cin.tie(0);
  ios::sync_with_stdio(false);
  cin >> n;
  FOR(i, 0, n){
    cin >> l[i];
    l[i] *= 50;
  }
  cin >> t;
  FOR(i, 0, t){
    cin >> s >> p;
    if(m.find(s) == m.end()) m[s].resize(n+1);
    int ip = p - 'A';
    m[s][ip] = l[ip] * (10 + ac[ip]) / (5 + ac[ip]);
    m[s][n] = i;
    ac[ip]++;
  }
  vector<pair<pii, string> > vv;
  each(itr, m){
    int ssum = 0;
    FOR(i, 0, n) ssum += itr->se[i];
    vv.pb(mp(mp(-ssum, itr->se[n]), itr->fi));
  }
  sort(rng(vv));
  FOR(i, 0, sz(vv)){
    cout << i+1 << " " << vv[i].se;
    FOR(j, 0, n) cout << " " << m[vv[i].se][j];
    cout << " " << -(vv[i].fi.fi);
    cout << endl;
  }
  return 0;
}