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

def single_battle(a_card, b_card)
  if a_card>b_card
    return "a"
  elsif b_card>a_card
    return "b"
  else
    return "draw"
  end
end

def battle(a_card_array, b_card_array)
  length = a_card_array.length
  a_score = 0
  b_score = 0
  for i in 0..(length-1)
    if single_battle(a_card_array[i], b_card_array[i]) == "a"
      a_score += 3
    elsif single_battle(a_card_array[i], b_card_array[i]) == "b"
      b_score += 3
    else
      a_score += 1
      b_score += 1
    end
  end
  return [a_score, b_score]
end


n = gets.chomp.to_i
a_card_array = []
b_card_array = []
n.times do
  hand = gets.chomp.split
  a_card_array.push(hand[0])
  b_card_array.push(hand[1])
end

puts battle(a_card_array, b_card_array).join(' ')