#include <cstdio>

#include <cstring>

#include <cstdlib>

#include <algorithm>

#define LL long long int

using namespace std;

const int MAXN = ;

int val[MAXN];

int pos[MAXN];

int cnt[MAXN];

int diff[MAXN];

bool vis[MAXN];

LL dp[MAXN];

int N;

int main()

{

    while ( scanf( "%d", &N ) ==  && N )

    {

        memset( cnt, , sizeof(int)*(N+) );

        memset( pos, , sizeof(int)*(N+) );

        for ( int i = ; i <= N; ++i )

        {

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

            ++cnt[ i - pos[ val[i] ] ];

            pos[ val[i] ] = i;

        }

        memset( vis, false, sizeof(bool)*(N+) );

        diff[] = ;

        vis[ val[N] ] = true;

        for ( int i = ; i <= N; ++i )

        {

            if ( vis[ val[N-i+] ] )

                diff[i] = diff[i - ];

            else

            {

                diff[i] = diff[i - ] + ;

                vis[ val[N-i+] ] = true;

            }

        }

        int tot = N;

        dp[] = N;

        for ( int i = ; i <= N; ++i )

        {

            dp[i] = dp[i - ] - diff[i - ];

            tot -= cnt[i - ];

            dp[i] += tot;

        }

        int Q;

        scanf("%d", &Q );

        while ( Q-- )

        {

            int w;

            scanf("%d", &w);

            printf("%I64d\n", dp[w] );

        }

    }

    return ;

}