Assume there are two programmers with their hacker names as Flash and Cisco. They both took part in a contest. The rules of the contest are as follows:
Flash submitted the solutions of the questions at times fp, fq, fr, and fs. Cisco submitted the solutions of the questions at times cp, cq, cr, and cs. Your task is to determine the winner of the contest. The winner is the one who has more score. If the score of both the programmers is the same, then the winner is the one who took less time to solve all the questions. If both the problems have the same score and took the same time to solve the questions, then print Tie.
Note
Input format
Output format
Print the winner of the competition, Flash or Cisco. If both the candidates have the same score and took same time to solve the questions, then print Tie.
Constraints
1≤T≤105100≤sp,sq,sr,ss≤1060≤dp,dq,dr,ds≤1060≤fp,fq,fr,fs≤1060≤cp,cq,cr,cs≤106
Flash submitted the solutions at time 110, 10, 7 and 8 for the questions P, Q, R and S, respectively. For question P he will get score of only 1000 - 110 * 1 = 890. For question Q he will get 2000 - 10 * 2 = 1980. Similarly, for question R and S, he will get 2790 and 3680. Therefore, the total score is 9340. Total time he took to solve all problems is 110.
Cisco submitted the solutions at time 15, 30, 45 and 55 for the questions P, Q, R and S, respectively. So he will get 985, 1940, 1650 and 3200 score for the questions P, Q, R and S, respectively. Total score is 7775. Total time he took to solve all problems is 45.
Since Flash's total score is greater than Cisco's, Flash is the winner.