#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef vector< int > vi;
typedef vector< vi > vvi;
typedef vector< ll > vl;
typedef vector< vl > vvl;
typedef pair< int, int > pii;
typedef vector< pii > vp;
typedef vector< double > vd;
typedef vector< vd > vvd;
typedef vector< string > vs;

template< class T1, class T2 >
int upmin( T1 &x, T2 v ){
  if( x > v ){
    x = v;
    return 1;
  }
  return 0;
}

template< class T1, class T2 >
int upmax( T1 &x, T2 v ){
  if( x < v ){
    x = v;
    return 1;
  }
  return 0;
}

const int INF = 0x3f3f3f3f;

int N;
vi L;
int T;
vs name, P;

void init(){
  cin >> N;
  L = vi( N );
  for( int i = 0; i < N; ++i ){
    cin >> L[ i ];
  }
  cin >> T;
  name = P = vs( T );
  for( int i = 0; i < T; ++i ){
    cin >> name[ i ] >> P[ i ];
  }
}

map< int, int > mp;

struct fenwick{
  vi dat;
  fenwick( int sz ){
    dat = vi( sz );
  }
  void update( int x, int v ){
    for( int i = x; i < dat.size(); i += i & -i ){
      dat[ i ] += v;
    }
  }
  int sum( int x ){
    int res = 0;
    for( int i = x; i > 0; i -= i & -i ){
      res += dat[ i ];
    }
    return res;
  }
} *ftree;

void preprocess(){
  vi prob_solved_cnt( N );
  map< string, int > user2score;
  vi score = { 0 };
  for( int i = 0; i < T; ++i ){
    if( P[ i ] == "?" ) continue;
    int p = P[ i ][ 0 ] - 'A';
    int v = user2score[ name[ i ] ];
    v += 50 * L[ p ] + 500 * L[ p ] / ( 8 + 2 * ++prob_solved_cnt[ p ] );
    user2score[ name[ i ] ] = v;
    score.emplace_back( v );
  }
  sort( score.begin(), score.end() );
  score.erase( unique( score.begin(), score.end() ), score.end() );
  for( int i = 0; i < score.size(); ++i ){
    mp[ score[ i ] ] = i + 1;
  }
  ftree = new fenwick( score.size() + 1 );
}

void solve(){
  vi prob_solved_cnt( N );
  map< string, int > user2score;
  map< string, int > user2rank_in_samescore;
  for( int i = 0; i < T; ++i ){
    if( user2score.count( name[ i ] ) ) continue;
    ftree->update( mp[ 0 ], 1 );
    user2score[ name[ i ] ] = 0;
    user2rank_in_samescore[ name[ i ] ] = 0;
  }
  for( int i = 0; i < T; ++i ){
    if( P[ i ] == "?" ){
      cout << ftree->sum( ftree->dat.size() - 1 ) - ftree->sum( mp[ user2score[ name[ i ] ] ] ) + user2rank_in_samescore[ name[ i ] ] + 1 << endl;
    } else{
      int p = P[ i ][ 0 ] - 'A';
      int v = user2score[ name[ i ] ];
      ftree->update( mp[ v ], -1 );
      v += 50 * L[ p ] + 500 * L[ p ] / ( 8 + 2 * ++prob_solved_cnt[ p ] );
      user2rank_in_samescore[ name[ i ] ] = ftree->sum( mp[ v ] ) - ftree->sum( mp[ v ] - 1 ); // 0 idx
      ftree->update( mp[ v ], 1 );
      user2score[ name[ i ] ] = v;
    }
  }
}

signed main(){
  ios::sync_with_stdio( 0 );
  init();
  preprocess();
  solve();
  return 0;
}