{"trustable":true,"prependHtml":"\u003cstyle type\u003d\u0027text/css\u0027\u003e\n .input, .output {\n border: 1px solid #888888;\n }\n .output {\n margin-bottom: 1em;\n position: relative;\n top: -1px;\n }\n .output pre, .input pre {\n background-color: #EFEFEF;\n line-height: 1.25em;\n margin: 0;\n padding: 0.25em;\n }\n \u003c/style\u003e\n \u003clink rel\u003d\"stylesheet\" href\u003d\"//codeforces.org/s/96598/css/problem-statement.css\" type\u003d\"text/css\" /\u003e\n\u003cscript\u003e\n window.katexOptions \u003d {\n delimiters: [\n {left: \u0027$$$$$$\u0027, right: \u0027$$$$$$\u0027, display: true},\n {left: \u0027$$$\u0027, right: \u0027$$$\u0027, display: false},\n {left: \u0027$$\u0027, right: \u0027$$\u0027, display: true},\n {left: \u0027$\u0027, right: \u0027$\u0027, display: false}\n ]\n };\n\u003c/script\u003e\n","sections":[{"title":"","value":{"format":"HTML","content":"\u003cp\u003eA big marathon is held on Al-Maza Road, Damascus. Runners came from all over the world to run all the way along the road in this big marathon day. The winner is the player who crosses the finish line first.\u003c/p\u003e\u003cp\u003eThe organizers write down finish line crossing time for each player. After the end of the marathon, they had a doubt between 2 possible winners named \"Player1\" and \"Player2\". They will give you the crossing time for those players and they want you to say who is the winner?\u003c/p\u003e"}},{"title":"Input","value":{"format":"HTML","content":"\u003cp\u003eFirst line contains number of test cases (1 \u003cspan class\u003d\"tex-span\"\u003e ≤ \u003c/span\u003e T \u003cspan class\u003d\"tex-span\"\u003e ≤ \u003c/span\u003e 100). Each of the next T lines represents one test case with 6 integers H1 M1 S1 H2 M2 S2. Where H1, M1, S1 represent Player1 crossing time (hours, minutes, seconds) and H2, M2, S2 represent Player2 crossing time (hours, minutes, seconds). You can assume that Player1 and Player2 crossing times are on the same day and they are represented in 24 hours format(0 \u003cspan class\u003d\"tex-span\"\u003e ≤ \u003c/span\u003e H1,H2 \u003cspan class\u003d\"tex-span\"\u003e ≤ \u003c/span\u003e 23 and 0 \u003cspan class\u003d\"tex-span\"\u003e ≤ \u003c/span\u003e M1,M2,S1,S2 \u003cspan class\u003d\"tex-span\"\u003e ≤ \u003c/span\u003e 59)\u003c/p\u003e\u003cp\u003eH1, M1, S1, H2, M2 and S2 will be represented by exactly 2 digits (leading zeros if necessary).\u003c/p\u003e"}},{"title":"Output","value":{"format":"HTML","content":"\u003cp\u003eFor each test case, you should print one line containing \"Player1\" if Player1 is the winner, \"Player2\" if Player2 is the winner or \"Tie\" if there is a tie.\u003c/p\u003e"}},{"title":"Examples","value":{"format":"HTML","content":"\u003ctable class\u003d\u0027vjudge_sample\u0027\u003e\n\u003cthead\u003e\n \u003ctr\u003e\n \u003cth\u003eInput\u003c/th\u003e\n \u003cth\u003eOutput\u003c/th\u003e\n \u003c/tr\u003e\n\u003c/thead\u003e\n\u003ctbody\u003e\n \u003ctr\u003e\n \u003ctd\u003e\u003cpre\u003e3\n18 03 04 14 03 05\n09 45 33 12 03 01\n06 36 03 06 36 03\n\u003c/pre\u003e\u003c/td\u003e\n \u003ctd\u003e\u003cpre\u003ePlayer2\nPlayer1\nTie\n\u003c/pre\u003e\u003c/td\u003e\n \u003c/tr\u003e\n\u003c/tbody\u003e\n\u003c/table\u003e\n"}}]}