#include <bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define pi M_PI
#define R cin>>
#define Z class
#define ll long long
#define ln cout<<'\n'
#define in(a) insert(a)
#define pb(a) push_back(a)
#define pd(a) printf("%.10f\n",a)
#define mem(a) memset(a,0,sizeof(a))
#define all(c) (c).begin(),(c).end()
#define iter(c) __typeof((c).begin())
#define rrep(i,n) for(int i=(int)(n)-1;i>=0;i--)
#define REP(i,m,n) for(int i=(int)(m);i<(int)(n);i++)
#define rep(i,n) REP(i,0,n)
#define tr(it,c) for(iter(c) it=(c).begin();it!=(c).end();it++)
template<Z A>void pr(A a){cout<<a;ln;}
template<Z A,Z B>void pr(A a,B b){cout<<a<<' ';pr(b);}
template<Z A,Z B,Z C>void pr(A a,B b,C c){cout<<a<<' ';pr(b,c);}
template<Z A,Z B,Z C,Z D>void pr(A a,B b,C c,D d){cout<<a<<' ';pr(b,c,d);}
template<Z A>void PR(A a,ll n){rep(i,n){if(i)cout<<' ';cout<<a[i];}ln;}
ll check(ll n,ll m,ll x,ll y){return x>=0&&x<n&&y>=0&&y<m;}
const ll MAX=1000000007,MAXL=1LL<<61,dx[4]={-1,0,1,0},dy[4]={0,1,0,-1};
typedef pair<int,int> P;
typedef pair<P,string> PP;

void Main() {
  int n;
  cin >> n;
  int a[n],b[n];
  rep(i,n) R a[i];
  mem(b);
  int T;
  cin >> T;
  map<string,vector<int> > m;
  rep(j,T) {
    string s;
    char c;
    cin >> s >> c;
    int x=c-'A';
    if(!m.count(s)) m[s].resize(n+2);
    b[x]++;
    int y=50*a[x]+(int)(50*a[x]/(0.8+0.2*b[x]));
    m[s][x]=y;
    m[s][n]+=y;
    m[s][n+1]=j;
  }
  vector<PP> v;
  tr(it,m) {
    int sum=0;
    vector<int> g=it->S;
    v.pb(PP(P(g[n],-g[n+1]),it->F));
  }
  sort(all(v),greater<PP>());
  rep(i,v.size()) {
    cout << i+1 << " " << v[i].S << " ";
    vector<int> g=m[v[i].S];
    PR(g,n+1);
  }
}

int main(){ios::sync_with_stdio(0);cin.tie(0);Main();return 0;}