/*
Bismillahir Rahmanir Rahim
(In the name of Allah)

@Author Muhammad Nadim
*/

/* Start of bits/stc++.h template */

// C++ includes used for precompiling -*- C++ -*-

// Copyright (C) 2003-2015 Free Software Foundation, Inc.
//
// This file is part of the GNU ISO C++ Library.  This library is free
// software; you can redistribute it and/or modify it under the
// terms of the GNU General Public License as published by the
// Free Software Foundation; either version 3, or (at your option)
// any later version.

// This library is distributed in the hope that it will be useful,
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
// GNU General Public License for more details.

// Under Section 7 of GPL version 3, you are granted additional
// permissions described in the GCC Runtime Library Exception, version
// 3.1, as published by the Free Software Foundation.

// You should have received a copy of the GNU General Public License and
// a copy of the GCC Runtime Library Exception along with this program;
// see the files COPYING3 and COPYING.RUNTIME respectively.  If not, see
// <http://www.gnu.org/licenses/>.

/** @file stdc++.h
 *  This is an implementation file for a precompiled header.
 */

// 17.4.1.2 Headers

// C
#ifndef _GLIBCXX_NO_ASSERT
#include <cassert>
#endif
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>

#if __cplusplus >= 201103L
#include <ccomplex>
#include <cfenv>
#include <cinttypes>
#include <cstdalign>
#include <cstdbool>
#include <cstdint>
#include <ctgmath>
#include <cwchar>
#include <cwctype>
#endif

// C++
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#include <memory>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <streambuf>
#include <string>
#include <typeinfo>
#include <utility>
#include <valarray>
#include <vector>

#if __cplusplus >= 201103L
#include <array>
#include <atomic>
#include <chrono>
#include <condition_variable>
#include <forward_list>
#include <future>
#include <initializer_list>
#include <mutex>
#include <random>
#include <ratio>
#include <regex>
#include <scoped_allocator>
#include <system_error>
#include <thread>
#include <tuple>
#include <typeindex>
#include <type_traits>
#include <unordered_map>
#include <unordered_set>
#endif

/* End of bits/stdc++.h template */

using namespace std;

#define ll long long
#define ld long double
#define nl '\n'
#define pi acos(-1.0)
#define sp fixed << setprecision(0)
#define MNTDH_18                      \
    ios_base::sync_with_stdio(false); \
    cin.tie(NULL);
#define yes cout << "YES\n"
#define no cout << "NO\n"
#define debug(x, n)            \
    for (ll i = 0; i < n; i++) \
    cout << x[i] << " "

// typedef  __int128 lll;
typedef struct rafi
{
    int priority;
    int idx;
    int bT;
} R;

typedef struct sajeeb
{
    ll val;
    ll idx;
} S;

const int N = 1e7 + 7, M = 1e9 + 7;
vector<int> nums;

void gen()
{
    for (int i = 1, j = 1; i <= 6; i++)
    {
        nums.push_back(j);
        j *= 2;
    }
}


bool cmp(S x, S y)
{
    if(x.val>y.val) return 1;
    else if(x.val==y.val)   return x.idx<y.idx;
    return 0;
}

bool cmp2(S x, S y)
{
    return x.val<y.val;
}

void sF()
{
    ll n, m, p;
    cin >> n;

    S a[n];

    for(int i=0; i<n; i++)
    {
        cin>>a[i].val;
        a[i].idx=i+1;
    }

    cin>>m;

    S b[m];

    for(int i=0; i<m; i++)
    {
        cin>>b[i].val;
        b[i].idx=n+i+1;
    }

    p=n+m;
    
    S c[p];

    for(int i=0; i<n; i++)
    {
        c[i].val=a[i].val;
        c[i].idx=a[i].idx;
    }
    for(int i=0, j=n; i<m; i++, j++)
    {
        c[j].val=b[i].val;
        c[j].idx=b[i].idx;
    }

    sort(c, c+p, cmp);

    S d[m];
    for(int i=0, k=0; i<p; i++)
    {
        if(c[i].idx>n)
        {
            d[k].val=c[i].idx;
            d[k].idx=i+1;
            k++;
        }
    }
    sort(d, d+m, cmp2);

    for(int i=0; i<m; i++)
    {
        if(i<m-1)   cout<<d[i].idx<<" ";
        else    cout<<d[i].idx;
    }
    //cout<<nl;
}

int main()
{
    MNTDH_18
    // Pow2();
    gen();

    ll tc = 1;
    //cin >> tc;

    while (tc--)
    {
        sF();
    }

    return 0;
}