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:

There are four questions to solve \(P\), \(Q\), \(R\), and \(S\).
Initial score (before the start of the contest) of the 4 problems is \(s_p\), \(s_q\), \(s_r\), and \(s_s\).
After each minute, the score of the questions, \(P\), \(Q\), \(R\), and \(S\) decreases by \(d_p\), \(d_q\), \(d_r\), and \(d_s\) respectively. The score cannot decrease below half (integer division) of the initial score for each question. In other words, at a specific time, the score of the problems can be the maximum of half of the initial score and the decreased score.

Flash submitted the solutions of the questions at times \(f_p\), \(f_q\), \(f_r\), and \(f_s\). Cisco submitted the solutions of the questions at times \(c_p\), \(c_q\), \(c_r\), and \(c_s\). 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

All the times are in minutes.
The time taken to solve all the questions is the time at which programmers submit the last solution.

Input format

First line: \(T\) denoting the number of test cases.
For each test case:
- First line: Four space-separated integers \(s_p\), \(s_q\), \(s_r\), and \(s_s\) denoting the initial scores of each problem
- Second line: Four space-separated integers \(d_p\), \(d_q\), \(d_r\), and \(d_s\) denoting the decrease in each problem's score after each minute
- Third line: Four space-separated integers \(f_p\), \(f_q\), \(f_r\), and \(f_s\) denoting the times when Flash submits his solutions
- Fourth line: Four space-separated integers \(c_p\), \(c_q\), \(c_r\), and \(c_s\) denoting the times when Cisco submitted his solutions

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 \le T \le 10^5\\ 100 \le s_p, s_q, s_r, s_s \le 10^6\\ 0 \le d_p, d_q, d_r, d_s \le 10^6\\ 0 \le f_p, f_q, f_r, f_s \le 10^6\\ 0 \le c_p, c_q, c_r, c_s \le 10^6\)