Chef and Card Game Problem Code: CRDGAME

Read problem statements in Mandarin Chinese.

Chef is playing a card game with his friend Morty Smith. 

The rules of the game are as follows:

• There are two piles of cards, pile A$$ and pile B$$, each with N$$ cards in it. Pile A$$belongs to Chef and pile B$$ belongs to Morty.
• Each card has one positive integer on it
• The ‘power’ of a card is defined as the sum of digits of the integer on that card
• The game consists of N$$ rounds
• In each round, both players simultaneously draw one card each from the top of their piles and the player who draws the card with higher power wins this round and gets a point. If the powers of both players' cards are equal then they get 1$\mathrm{}$ point each. 
• The winner of the game is the player who has more points at the end of N$$rounds. If both players have equal number of points then the game ends in a draw.

The game is now over and Chef has told Morty to find the winner. Unfortunately, this task is too complex for him. Help Morty find the winner. 

Input:

• First line will contain T$$, number of testcases.
• The first line of each test case will contain N$$, the number of rounds played.
• The ith${}^{}$ of the next N$$ lines of each test case will contain Ai${}_{}$ and Bi${}_{}$, the number on the card drawn by Chef and Morty respectively in round i$$.

Output:

For each test case, output two space separated integers on a new line:
Output 

• 0$\mathrm{}$ if Chef wins, 
• 1$\mathrm{}$ if Morty wins, 
• 2$\mathrm{}$ if it is a draw,
  followed by the number of points the winner had.
  (If it is a draw then output either player’s points).

Constraints

• 1≤T≤1000$\mathrm{}\mathrm{}$
• 1≤N≤100$\mathrm{}\mathrm{}$
• 1≤Ai,Bi≤109$\mathrm{}{}_{}{}_{}{\mathrm{}}^{\mathrm{}}$

Subtasks

• 100$\mathrm{}$ points : No additional constraints

Sample Input:

2
3
10 4
8 12
7 6
2
5 10
3 4

Sample Output:

0 2
2 1

Explanation:

Test Case 1$\mathrm{}$:

Round 1$\mathrm{}$: 

Chef’s card has power 1+0$\mathrm{}\mathrm{}$ = 1$\mathrm{}$,
Morty’s card has power 4$\mathrm{}$.
Therefore, Morty wins the round. 

Round 2$\mathrm{}$: 

Chef’s card has power 8$\mathrm{}$,
Morty’s card has power 1+2$\mathrm{}\mathrm{}$ = 3$\mathrm{}$.
Therefore, Chef wins the round. 

Round 3$\mathrm{}$: 

Chef’s card has power 7$\mathrm{}$,
Morty’s card has power 6$\mathrm{}$.
Therefore, Chef wins the round. 

Therefore, Chef wins the game with 2$\mathrm{}$ points (Morty has 1$\mathrm{}$ point). 

Test Case 2$\mathrm{}$:

Round 1$\mathrm{}$: 

Chef’s card has power 5$\mathrm{}$,
Morty’s card has power 1+0=1$\mathrm{}\mathrm{}\mathrm{}$.
Therefore, Chef wins the round. 

Round 2$\mathrm{}$: 

Chef’s card has power 3$\mathrm{}$,
Morty’s card has power 4$\mathrm{}$.
Therefore, Morty wins the round. 

Therefore, the game ends in a draw and both players have 1$\mathrm{}$ point each.