#include <bits/stdc++.h>
#define int long long
using namespace std;
int n,q,a[1005][1005],v,ans=0,cny;
bool cmp(int c,int d){
    return c>d;
}
signed main(){
    ios::sync_with_stdio(0);
    cin >> n;
    for(int i=1;i<=n;i++){
        for(int j=1;j<=n;j++){
            cin >> a[cny++][cny++];
        } 
    }
    sort(a+1,a+1+cny,cmp);
    while(q--){
        cin >> v;
        int ans=0,l=1,r=cny;
        while(l<=r){
            int mid=(l+r)/2;
            if(a[mid]<x) r=mid-1;
            else{
                l=mid+1;
                ans=mid;
            }
        }
        cout << min(ans,n) << endl;
    }
    return 0;
}