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 C# (judge verdict: Wrong Answer)

using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;

namespace ConsoleApplication17
{
    class Program
    {
        static void Main(string[] args)
        {
            string str1 = Console.ReadLine();
            int n = int.Parse(str1);

            string alphabet = "abcdefghijklmnopqrstuvwxyz";
            int hanakoPoint = 0;
            int taroPoint = 0;

            //n???????????????
            for (int i = 0; i < n; ++i)                             
            {
                string[] str2 = Console.ReadLine().Split(' ');
                string taro = str2[0];
                string hanako = str2[1];
                int index = 0;

                //????????????????????????????????????????????????
                if((taro.Contains(hanako)) || (hanako.Contains(taro)))
                {
                    //?????´?????????????????????????????£?????????????????§??????????????????????????§???????????£??????????????????
                    if (taro.Length < hanako.Length)
                    {
                        taroPoint += 3;
                        continue;
                    }
                    else if (taro.Length > hanako.Length)
                    {
                        hanakoPoint += 3;
                        continue;
                    }
                    else
                    {
                        ++taroPoint;
                        ++hanakoPoint;
                        continue;
                    }
                }

                //????????????????????°???????????§??°?????????
                for (int j = 0; j <= 50; ++j)
                {
                    if (taro[j] != hanako[j])
                    {
                        index = j;
                        break;
                    }

                }

                //????????????????????????????????????
                int taroIndex = alphabet.IndexOf(taro[index]);
                int hanakoIndex = alphabet.IndexOf(hanako[index]);

                //????´????????????§?????????????????????
                if (taroIndex < hanakoIndex)
                {
                    hanakoPoint += 3;
                }
                else if (taroIndex > hanakoIndex)
                {
                    taroPoint += 3;
                }
            }

            Console.WriteLine("{0} {1}", taroPoint, hanakoPoint);
        }
    }
}