#include <iostream>
#include <math.h>
using namespace std;

const int MAXROUNDS = 7;
const int MAXPLAYERS = 128;  // 2^MAXROUNDS

int results[2*MAXPLAYERS];


int main(void)
{
   int i,j; 
   int first=1;
	results[0] = -1;
	int n;
	cin >> n;
	while (n != 0) {
                       if(first)
                         first=0;
                       else
                         cout<<endl;
                         
		int nplayers = pow(2,n);
		int k=2*nplayers-1;
		for(i=1; i<=nplayers; i++)
			results[k--] = i;
		for(i=1;i<=nplayers-1; i++)
			cin >> results[k--];
		int m;
		cin >> m;
		for(i=0; i<m; i++) {
			int player;
			cin >> player;
			int level = 0;
			for(j = 2*nplayers-player; j>1; j /= 2) {
				if (results[j/2] != player)
					break;
				level++;
			}
			int above = 0;
			while (j != 1) {
				if (results[j/2] != results[j])
					above++;
				j /= 2;
			}

			cout << "Player " << player << " can be ranked as high as " << above+1
				 << " or as low as " << nplayers - pow(2,level) + 1 << '.'<<endl;
		}

		cin >> n;
	}
}