// 2024 IUSB Programming Competition
// Round 1 Problem 4
// Class Rank
// Solution by Liguo Yu

#include <iostream>
#include <cstdlib>
#include <ctime>

using namespace std;

int main()
{
    int n;
    cin >> n;

    char names[n][11];
    int scores[n];

    for(int i = 0; i < n; i++)
    {
        cin >> names[i][0];
    }

    for(int i = 0; i < n; i++)
    {
        cin >> scores[i];
    }

    for (int i = 0; i < n-1; i++) 
    { 
        int min_idx = i; 
        for (int j = i+1; j < n; j++)
        {
            if (scores[j] < scores[min_idx]) 
                min_idx = j; 
        }
        
        swap(scores[min_idx], scores[i]); 
        swap(names[min_idx], names[i]); 
    } 

    for (int i = n-1; i >= 0; i--) 
    { 
        cout << names[i][0] << " ";
    } 
    cout << endl;
}