int rank = 1;
            map<string,int>::iterator it;
            for(it = shop.begin();it != shop.end(); it++){
                if(it->second>shop["memory"])
                    rank++;
            }
            cout<<rank<<endl; 

#include <iostream>
#include <string>
#include <map>
#include <algorithm>

using namespace std;

bool my_camp(int x,int y){
    return x>y;
}

int main()
{
    int n,m,p;
    int a[10001];
    map<string,int>shop;
    while(cin>>n){
        string s;
        for(int i = 1;i <= n; i++)
            cin>>s;
        cin>>m;
        while(m--){
            for(int i = 1;i <= n; i++){
                cin>>p>>s;
                shop[s] += p;
                a[i] = shop[s];
            }
            /*int rank = 1;
            map<string,int>::iterator it;
            for(it = shop.begin();it != shop.end(); it++){
                if(it->second>shop["memory"])
                    rank++;
            }
            cout<<rank<<endl; */
            sort(a+1,a+n+1,my_camp);
            for(int i = 1;i <= n; i++){
                if(a[i] == shop["memory"]){
                    cout<<i<<endl;
                    break;
                }
            }
        }
        shop.clear();
    } 
    return 0;
}