Թաքցված խնդիր
|Այս խնդիրը թաքցված է խմբագրական խրհրդի անդամի կողմից քանի որ կամ այն ոչ ճիշտ լեզվով է գրված,|կամ թեստային տվյալներն են սխալ, կամ խնդրի ձևակերպումը պարզ չէ։|

## ACM_0193 - DICE GAME

Gunnar and Emma play a lot of board games at home, so they own many dice that are not normal 6- sided dice. For example they own a die that has 10 sides with numbers 47, 48, . . . , 56 on it.

There has been a big storm in Stockholm, so Gunnar and Emma have been stuck at home without electricity for a couple of hours. They have finished playing all the games they have, so they came up with a new one. Each player has 2 dice which he or she rolls. The player with a bigger sum wins. If both sums are the same, the game ends in a tie.

Given the description of Gunnar’s and Emma’s dice, which player has higher chances of winning?

All of their dice have the following property: each die contains numbers a, a + 1, . . . , b, where a and b are the lowest and highest numbers respectively on the die. Each number appears exactly on one side, so the die has b a + 1 sides.

#### Input

The first line contains four integers a1, b1, a2, b2 that describe Gunnar’s dice. Die number i contains numbers ai, ai + 1, . . . , bi on its sides. You may assume that 1 ai bi 100. You can further assume that each die has at least four sides, so ai + 3 bi.

The second line contains the description of Emma’s dice in the same format.

#### Output

Output the name of the player that has higher probability of winning. Output “Tie” if both players have same probability of winning.

 № stdin stdout 1 1 4 1 4 1 6 1 6 Emma 2 1 8 1 8 1 10 2 5 Tie 3 2 5 2 7 1 5 2 5 Gunnar

 Ավելացրեց. Հրանտ Հովհաննիսյան Ամսաթիվ. 2014-10-08 Ժամանակի սահմանափակումը. 1s Ծրագրի տեքստի սահմանափակումը. 50000B Memory limit: 1536MB Cluster: Cube (Intel G860) Լեզուներ. Բոլորը բացի ASM32 ASM64 GAWK CLPS CLOJURE D ERL FSHARP FORTRAN GOSU HASK ICON ICK NEM NIM OBJC-CLANG PICO PIKE PYPY PY_NBC RUST SCM guile CHICKEN SED TCL WHITESPACE Աղբյուրը. Nordic (NCPC) 2014.D