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 Scala (judge verdict: Accepted)

import scala.io.Source

object Main extends App {
  val src = Source.stdin.getLines

  val turns: Int = src.next.toInt

  def versus(n: Int, acc: List[Int]): List[Int] = {
    if (n <= 0) acc
    else { val Array(taro, hana) = src.next.split(" ")
           if (taro > hana) versus(n - 1, acc.updated(0, acc(0) + 3))
           else if (taro < hana) versus(n - 1, acc.updated(1, acc(1) + 3))
           else versus(n - 1, acc.map(x => x + 1))
    }
  }

  val result: List[Int] = versus(turns, List(0, 0))
  println(result.mkString(" "))
}