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: Time Limit Exceeded)

#include <stdio.h>
#include <string.h>

int win(char*,char*);

int win(char* x,char* y){
  int i,j;
  
  if( j=strcmp(x,y)==0 ){
    return 0;
  }else{
    while( 1 ){
      j=strncmp(x,y,i);
      if( j==1 ) return -1;
      else if( j==-1 ) return 1;
      else i++;
    }
  }
}

int main(){
  int i,n,judge,ts=0,hs=0;
  char ta[101],ha[101];
    
  scanf("%d",&n);
  for(i=0;i<n;i++){
    scanf("%s %s",ta,ha);
    judge = win(ta,ha);
    if(judge==1) hs+=3;
    else if(judge==-1) ts+=3;
    else{
      ts++;
      hs++;
    }
  }
  printf("%d %d\n",ts,hs);
  
  return 0;
}