#include <cstdio>

 const int MAXN = ;

 int n, k, Q, h, t;

 int a[MAXN], q[MAXN], f[MAXN];

 inline bool cmp(int x, int y)

 {

     return f[x] > f[y] || (f[x] == f[y] && a[x] < a[y]);

 }

 int main()

 {

     int i;

     scanf("%d", &n);

     for(i = ; i <= n; i++) scanf("%d", &a[i]);

     scanf("%d", &Q);

     while(Q--)

     {

         scanf("%d", &k);

         f[q[] = h = t = ] = ;

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

         {

             while(h <= t && q[h] < i - k) h++;

             f[i] = f[q[h]] + (a[q[h]] <= a[i]);

             while(h <= t && cmp(q[t], i)) t--;

             q[++t] = i;

         }

         printf("%d\n", f[n]);

     }

     return ;

 }