Problem:
Card Game

Taro and Hanako are playing card games. They have n cards each, and they compete n turns. At each turn Taro and Hanako respectively puts out a card.
The name of the animal consisting of alphabetical letters is written on each card, and the bigger one in lexicographical order becomes the winner of that turn. The winner obtains 3 points. In the case of a draw, they obtain 1 point each.

Write a program which reads a sequence of cards Taro and Hanako have and reports the final scores of the game.

Input

In the first line, the number of cards n is given. In the following n lines, the cards for n turns are given respectively. For each line, the first string represents the Taro's card and the second one represents Hanako's card.

Constraints

n ≤ 1000

The length of the string ≤ 100

Output

Print the final scores of Taro and Hanako respectively. Put a single space character between them.

Sample Input

3
cat dog
fish fish
lion tiger

Sample Output

1 7

Solution in JAVA (judge verdict: Wrong Answer)

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;

public class Main
{
	public static void main(String[] args)throws IOException
	{
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		int T=0, H=0, n=0;
		char t_chr, h_chr;
		String[] animal = new String[2];
		n = Integer.parseInt(br.readLine());

		for(int i=0; i<n; i++)
		{
			animal = br.readLine().split(" ");
			if(animal[0]==animal[1])
			{
				T++;
				H++;
				continue;
			}
			else
			{
				for(int j=0; j<animal[0].length(); j++)
				{
					t_chr = animal[0].charAt(j);
					h_chr = animal[1].charAt(j);
					if(t_chr>h_chr)
					{
						T = T + 3;
						break;
					}
					else if(t_chr<h_chr)
					{
						H = H + 3;
						break;
					}
					else if(j==animal[0].length()-1)
					{
						if(animal[0].length()>animal[1].length())	T = T + 3;
						else	 if(animal[0].length()<animal[1].length())	H = H + 3;
					}
				}
			}
		}
		System.out.println(T + " " + H);
	}
}