Problem: Do you know Speed? It is one of popular card games, in which two players compete how quick they can move their cards to tables.

To play Speed, two players sit face-to-face first. Each player has a deck and a tableau assigned for him, and between them are two tables to make a pile on, one in left and one in right. A tableau can afford up to only four cards.

There are some simple rules to carry on the game:

1. A player is allowed to move a card from his own tableau onto a pile, only when the rank of the moved card is a neighbor of that of the card on top of the pile. For example A and 2, 4 and 3 are neighbors. A and K are also neighbors in this game.
2. He is also allowed to draw a card from the deck and put it on a vacant area of the tableau.
3. If both players attempt to move cards on the same table at the same time, only the faster player can put a card on the table. The other player cannot move his card to the pile (as it is no longer a neighbor of the top card), and has to bring it back to his tableau.



First each player draws four cards from his deck, and places them face on top on the tableau. In case he does not have enough cards to fill out the tableau, simply draw as many as possible. The game starts by drawing one more card from the deck and placing it on the tables on their right simultaneously. If the deck is already empty, he can move an arbitrary card on his tableau to the table.

Then they continue performing their actions according to the rule described above until both of them come to a deadend, that is, have no way to move cards. Every time a deadend occurs, they start over from each drawing a card (or taking a card from his or her tableau) and placing on his or her right table, regardless of its face. The player who has run out of his card first is the winner of the game.

Mr. James A. Games is so addicted in this simple game, and decided to develop robots that plays it. He has just completed designing the robots and their program, but is not sure if they work well, as the design is so complicated. So he asked you, a friend of his, to write a program that simulates the robots.

The algorithm for the robots is designed as follows:

* A robot draws cards in the order they are dealt.
* Each robot is always given one or more cards.
* In the real game of Speed, the players first classify cards by their colors to enable them to easily figure out which player put the card. But this step is skipped in this simulation.
* The game uses only one card set split into two. In other words, there appears at most one card with the same face in the two decks given to the robots.
* As a preparation, each robot draws four cards, and puts them to the tableau from right to left.
* If there are not enough cards in its deck, draw all cards in the deck.
* After this step has been completed on both robots, they synchronize to each other and start the game by putting the first cards onto the tables in the same moment.
* If there remains one or more cards in the deck, a robot draws the top one and puts it onto the right table. Otherwise, the robot takes the rightmost card from its tableau.
* Then two robots continue moving according to the basic rule of the game described above, until neither of them can move cards anymore.
* When a robot took a card from its tableau, it draws a card (if possible) from the deck to fill the vacant position after the card taken is put onto a table.
* It takes some amount of time to move cards. When a robot completes putting a card onto a table while another robot is moving to put a card onto the same table, the robot in motion has to give up the action immediately and returns the card to its original position.
* A robot can start moving to put a card on a pile at the same time when the neighbor is placed on the top of the pile.
* If two robots try to put cards onto the same table at the same moment, only the robot moving a card to the left can successfully put the card, due to the position settings.
* When a robot has multiple candidates in its tableau, it prefers the cards which can be placed on the right table to those which cannot. In case there still remain multiple choices, the robot prefers the weaker card.
* When it comes to a deadend situation, the robots start over from each putting a card to the table, then continue moving again according to the algorithm above.
* When one of the robots has run out the cards, i.e., moved all dealt cards, the game ends.
* The robot which has run out the cards wins the game.
* When both robots run out the cards at the same moment, the robot which moved the stronger card in the last move wins.



The strength among the cards is determined by their ranks, then by the suits. The ranks are strong in the following order: A > K > Q > J > X (10) > 9 > . . . > 3 > 2. The suits are strong in the following order: S (Spades) > H (Hearts) > D (Diamonds) > C (Cloves). In other words, SA is the strongest and C2 is the weakest.

The robots require the following amount of time to complete each action:

* 300 milliseconds to draw a card to the tableau,
* 500 milliseconds to move a card to the right table,
* 700 milliseconds to move a card to the left table, and
* 500 milliseconds to return a card to its original position.



Cancelling an action always takes the constant time of 500ms, regardless of the progress of the action being cancelled. This time is counted from the exact moment when the action is interrupted, not the beginning time of the action.

You may assume that these robots are well-synchronized, i.e., there is no clock skew between them.

For example, suppose Robot A is given the deck “S3 S5 S8 S9 S2” and Robot B is given the deck “H7 H3 H4”, then the playing will be like the description below. Note that, in the description, “the table A” (resp. “the table B”) denotes the right table for Robot A (resp. Robot B).

* Robot A draws four cards S3, S5, S8, and S9 to its tableau from right to left. Robot B draws all the three cards H7, H3, and H4.
* Then the two robots synchronize for the game start. Let this moment be 0ms.
* At the same moment, Robot A starts moving S2 to the table A from the deck, and Robot B starts moving H7 to the table B from the tableau.
* At 500ms, the both robots complete their moving cards. Then Robot A starts moving S3 to the table A 1(which requires 500ms), and Robot B starts moving H3 also to the table A (which requires 700ms).
* At 1000ms, Robot A completes putting S3 on the table A. Robot B is interrupted its move and starts returning H3 to the tableau (which requires 500ms). At the same time Robot A starts moving S8 to the table B (which requires 700ms).
* At 1500ms, Robot B completes returning H3 and starts moving H4 to the table A (which requires 700ms).
* At 1700ms, Robot A completes putting S8 and starts moving S9 to the table B.
* At 2200ms, Robot B completes putting H4 and starts moving H3 to the table A.
* At 2400ms, Robot A completes putting S9 and starts moving S5 to the table A.
* At 2900ms, The both robots are to complete putting the cards on the table A. Since Robot B is moving the card to the table left to it, Robot B completes putting H3. Robot A is interrupted.
* Now Robot B has finished moving all the dealt cards, so Robot B wins this game.



Input

The input consists of multiple data sets, each of which is described by four lines. The first line of each data set contains an integer NA , which specifies the number of cards to be dealt as a deck to Robot A. The next line contains a card sequences of length NA . Then the number NB and card sequences of length NB for Robot B follows, specified in the same manner.

In a card sequence, card specifications are separated with one space character between them. Each card specification is a string of 2 characters. The first character is one of ‘S’ (spades), ‘H’ (hearts), ‘D’ (diamonds) or ‘C’ (cloves) and specifies the suit. The second is one of ‘A’, ‘K’, ‘Q’, ‘J’, ‘X’ (for 10) or a digit between ‘9’ and ‘2’, and specifies the rank. As this game is played with only one card set, there is no more than one card of the same face in each data set.

The end of the input is indicated by a single line containing a zero.

Output

For each data set, output the result of a game in one line. Output “A wins.” if Robot A wins, or output “B wins.” if Robot B wins. No extra characters are allowed in the output.

Example

Input

1
SA
1
C2
2
SA HA
2
C2 C3
5
S3 S5 S8 S9 S2
3
H7 H3 H4
10
H7 CJ C5 CA C6 S2 D8 DA S6 HK
10
C2 D6 D4 H5 DJ CX S8 S9 D3 D5
0


Output

A wins.
B wins.
B wins.
A wins.

Solution (in CPP):

Solution:
#include<iostream>
#include<stack>
#include<queue>
#include<cassert>
#include<algorithm>
#include<vector>
#include<map>
using namespace std;
#define REP(i,b,n) for(int i=b;i<n;i++)
#define rep(i,n)   REP(i,0,n)
#define pb         push_back
typedef long long ll;

const ll inf =(1LL)<<50;

enum{IDLE=-1,PUTR=0,PUTL=1,DRAW=2,BACK=3};

bool isend(int *a){
  rep(i,4)if (a[i]!=-1)return false;
  return true;
}

//0123456789012
bool canput(int a,int b){
  int vala=a/4,valb=b/4;
  return (vala+1)%13 == valb||(valb+1)%13==vala;
}

bool isgreater(int a,int b){//a>b?
  if (a/4 != b/4)return a/4 > b/4;
  else return a%4 > b%4;
}

bool solve(queue<int> *deck){
  ll now=0,time[2];
  int have[2][4];
  int table[2];
  int state[2];
  int hand[2],place[2];
  int lastput[2];

  rep(i,2){
    rep(j,4)have[i][j]=-1;
    rep(j,4 && deck[i].size()){
      have[i][j]=deck[i].front();
      deck[i].pop();
    }
  }

  state[0]=IDLE;
  state[1]=IDLE;

  while(true){
    ll next=inf;
    //take min time
    if (state[0]==IDLE&&state[1]==IDLE){
      rep(i,2){
	if (deck[i].size()){
	  table[i]=deck[i].front();
	  deck[i].pop();
	}else {
	  //	  for(int j=3;j>=0;j--){
	  rep(j,4){
	    if (have[i][j] != -1){
	      lastput[i]=have[i][j];
	      table[i]=have[i][j];
	      have[i][j]=-1;
	      break;
	    }
	  }
	}
      }
      next=500;
      time[0]=time[1]=0;
      state[0]=state[1]=IDLE;
    }else if(state[0]==IDLE){
      next=time[1];
    }else if(state[1]==IDLE){
      next=time[0];
    }else next=min(time[0],time[1]);

    if (next == inf);
    else now+=next;
    //     cout << "current time " << now << endl;
    //     cout << "state " << state[0] <<" " << state[1] << endl;
    //     cout << "table " << table[0] <<" " << table[1] << endl;

    //pass time
    rep(i,2)if (state[i] != IDLE)time[i]-=next;

    //interrupt
    rep(i,2){
      if ((state[i]==PUTR && state[1-i]==PUTL && time[i]==0 &&time[1-i]!=0) ||
	  (state[i]==PUTL && state[1-i]==PUTR && time[i]==0)){
	have[1-i][place[1-i]]=hand[1-i];
	time[1-i]=500;
	state[1-i]=BACK;
      }
    }
		
    //    cout << table[0]<<" " << table[1]4 << endl;
    //    cout <<"state "<< state[0] <<" " << state[1] << endl;
    
    //done this action and choose next action(no dependencies)
    rep(i,2){
      if (time[i]!=0)continue;
      if (state[i]==IDLE){
      }else if (state[i] == PUTR || state[i]==PUTL){
	//DRAW or choose nexthand
	//	cout <<"hand " << i <<" " <<  hand[i] << endl;
	if (state[i]==PUTR)table[i]=hand[i];
	else if (state[i]==PUTL)table[1-i]=hand[i];
	lastput[i]=hand[i];
	if (deck[i].size()){
	  hand[i]=deck[i].front();
	  deck[i].pop();
	  time[i]=300;
	  state[i]=DRAW;
	}else have[i][place[i]]=-1;
      }else if (state[i] == DRAW){
	//choose next hand
	have[i][place[i]]=hand[i];
      }else if(state[i] == BACK){
	//choose next hand
      }
    }

    //choose next action(depend on other)
    rep(i,2){
      if (time[i] != 0)continue;
      state[i]=IDLE;
      hand[i]=-1;
      //right
      rep(j,4){
	if (have[i][j]!=-1&&
	    canput(have[i][j],table[i])&&
	    (hand[i]==-1||isgreater(hand[i],have[i][j]))){
	  hand[i]=have[i][j];
	  place[i]=j;
	  state[i]=PUTR;
	  time[i]=500;
	}
      }
      if (state[i]==IDLE){
	rep(j,4){
	  if (have[i][j]!=-1&&
	      canput(have[i][j],table[1-i])&&
	      (hand[i]==-1||isgreater(hand[i],have[i][j]))){
	    hand[i]=have[i][j];
	    place[i]=j;
	    state[i]=PUTL;
	    time[i]=700;
	  }
	}
      }
      //if (state[i] != IDLE)have[i][place[i]]=-1;
    }

//      cout << state[0] <<" " << state[1] << 
//        " table: " << table[0] <<" " << table[1] << endl;
//      cout << "next " << time[0] <<" " << time[1] << endl;
//      cout <<"hand " << hand[0] <<" " << hand[1] << endl;
//      rep(i,2){
//       rep(j,4)cout << have[i][j]<<" ";
//        cout << endl;
//      }

    if (isend(have[0])&&isend(have[1]))return lastput[0]>lastput[1];
    else if (isend(have[0]))return true;
    else if (isend(have[1]))return false;
  }
  assert(false);
}

//23456789HJQKA
int main(){
  string suit="CDHS";
  string tmp="23456789XJQKA";
  map<string,int> M;
  rep(j,tmp.size()){
    rep(i,suit.size()){
      string ins=string(1,suit[i]);
      ins+=tmp[j];
      M[ins]=i+j*4;
    }
  }
  
  int n;
  while(cin>>n && n){
    queue<int> S[2];
    rep(i,n){
      string in;
      cin>>in;
      //      cout << in <<" " << M[in] << endl;
      S[0].push(M[in]);
    }
    cin>>n;
    rep(i,n){
      string in;
      cin>>in;
      //      cout << in <<" " << M[in] << endl;
      S[1].push(M[in]);
    }

    if (solve(S))cout <<"A wins."<<endl;
    else cout << "B wins."<<endl;
  }
  return false;
}