import std.conv, std.functional, std.range, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.complex, std.container, std.math, std.numeric, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }
int readInt() { return readToken.to!int; }
long readLong() { return readToken.to!long; }
real readReal() { return readToken.to!real; }

bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }
bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }

int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; }
int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); }
int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); }


void bAdd(T)(T[] bit, int pos, T val)
in {
  assert(0 <= pos && pos < bit.length, "bAdd: 0 <= pos < |bit| must hold");
}
do {
  for (int x = pos; x < bit.length; x |= x + 1) {
    bit[x] += val;
  }
}

// sum of [0, pos)
T bSum(T)(T[] bit, int pos)
in {
  assert(0 <= pos && pos <= bit.length, "bSum: 0 <= pos <= |bit| must hold");
}
do {
  T sum = 0;
  for (int x = pos - 1; x >= 0; x = (x & (x + 1)) - 1) {
    sum += bit[x];
  }
  return sum;
}


int N;
real[] L;
int T;
string[] S, P;

class Contestant {
  string name;
  int[] scores;
  int sum;
  int last;
}

void main() {
  try {
    for (; ; ) {
      N = readInt();
      L = new real[N];
      foreach (j; 0 .. N) {
        L[j] = readReal();
      }
      T = readInt();
      S = new string[T];
      P = new string[T];
      foreach (t; 0 .. T) {
        S[t] = readToken();
        P[t] = readToken();
      }
      
      int[string] ids;
      int m;
      foreach (t; 0 .. T) {
        if (S[t] !in ids) {
          ids[S[t]] = m++;
        }
      }
      debug {
        writeln("ids = ", ids);
      }
      
      Tuple!(int, int)[] ys;
      foreach (phase; 0 .. 2) {
        auto scores = new int[m];
        auto last = new int[m];
        auto cnt = new int[N];
        if (phase == 0) {
          ys ~= tuple(0, 0);
        }
        int[] bit;
        if (phase == 1) {
          bit = new int[ys.length];
        }
        foreach (t; 0 .. T) {
          const i = ids[S[t]];
          if (P[t] == "?") {
            if (phase == 1) {
              const ans = bit.bSum(ys.lowerBound(tuple(-scores[i], last[i])));
              writeln(ans + 1);
            }
          } else {
            const j = P[t][0] - 'A';
            if (phase == 1) {
              bit.bAdd(ys.lowerBound(tuple(-scores[i], last[i])), -1);
            }
            ++cnt[j];
            scores[i] += cast(int)(50 * L[j] + 5 * 50 * L[j] / (4 + cnt[j]));
            last[i] = t;
            if (phase == 0) {
              ys ~= tuple(-scores[i], last[i]);
            }
            if (phase == 1) {
              bit.bAdd(ys.lowerBound(tuple(-scores[i], last[i])), +1);
            }
          }
        }
        if (phase == 0) {
          ys = ys.sort.uniq.array;
          debug {
            writeln("ys = ", ys);
          }
        }
      }
    }
  } catch (EOFException e) {
  }
}