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

int main() {
    map<int, int> mp;  // key: 元素值，value: 排名
    int n, tmp, m;
    cin >> n;
    for (int i = 0; i < n; ++i) {
        cin >> tmp;
        mp.emplace(tmp, 0);
    }

    int cnt = 1;
    for (auto &pair : mp) {
        pair.second = cnt++;
    }

    cin >> m;
    for (int i = 0; i < m; ++i) {
        cin >> tmp;
        if (mp.find(tmp) != mp.end()) {
            cout << mp[tmp] << '\n';
        } else {
            cout << "No\n";
        }
    }
    return 0;
}

int main()

{

int n = 0;

int m = 0;

int num[10] = { 0 };

int find[10] = { 0 };

printf("请输入咖啡种类数量：");

scanf("%d", &n);

printf("请输入每种咖啡的序号：");

for (int i = 0; i < n; i++)

{

scanf("%d", &num[i]);

} printf("请输入要查找的咖啡的个数：");

scanf("%d", &m);

printf("请输入要查找的咖啡的序号：\n");

for (int i = 0; i < m; i++)

{

scanf("%d", &find[i]);

}

printf("要查找的咖啡的序号分别为：\n");

for (int i = 0; i < m; i++)

{

for (int j = 0; j < n; j++)

{

if (find[i] == num[j])

{

printf("%d\n", j +1);

}

}

}

return 0;

}