# Code challenge .cls-1{fill:var(--color-telefonica);}

## Challenge 3 - The night of the hunter

Love or Hate? True or False? Create or Destroy? Which word would win in a hypothetical fight between antonyms? It depends on the values of the letters, of course.

### Input

The first line has an integer N, which is the number of cases for the problem. Each case is a fight between two antonyms. Each line has:

1. Two opposite words separated by '-'
2. The character '|'
3. The value of each letter, which can be an integer or a fraction. The list of letters with its values can be in many formats:
• As a dictionary:
`{'a': 2/3, 'e': 4, 'h': 3, 'l': 5, 'o': 1, 't': 6, 'v': 0}`
• As a list of tuples:
`[('a', 2/3), ('e', 4), ('h', 3), ('l', 5), ('o', 1), ('t', 6), ('v', 0)]`
• As a list of assignments:
`a=2/3,e=4,h=3,l=5,o=1,t=6,v=0`

### Output

For each case, there should be a line starting with "Case #x: " followed by the winning word or '-' when the result is a draw.

### Sample Input

```10
love-hate|a=2,e=4,h=3,l=5,o=1,t=6,v=0
low-high|[('g', 1/3), ('h', 2), ('i', 1/9), ('l', 4), ('o', 0), ('w', 1/8)]
clever-stupid|c=6/9,d=5/6,e=8/9,i=1/7,l=0,p=8/10,r=5/10,s=6/9,t=5/6,u=4/10,v=3/8
lose-find|{'d': 3, 'e': 0, 'f': 5, 'i': 2, 'l': 1, 'n': 4, 'o': 7, 's': 6}
win-lose|e=1,i=4,l=2,n=0,o=6,s=3,w=5
blame-praise|[('a', 5), ('b', 8), ('e', 4), ('i', 2), ('l', 0), ('m', 1), ('p', 3), ('r', 6), ('s', 7)]
false-true|{'a': 7/9, 'e': 2/5, 'f': 3, 'l': 0, 'r': 7, 's': 2, 't': 5, 'u': 1/5}
soft-hard|a=0,d=1,f=4,h=7,o=2,r=5,s=6,t=3
rough-smooth|g=7/10,h=7/9,m=3,o=4,r=6,s=1,t=4/5,u=3/10
tame-wild|{'a': 1, 'd': 5, 'e': 3, 'i': 0, 'l': 2, 'm': 4, 't': 7, 'w': 6}
```

### Sample Output

```Case #1: hate
Case #2: high
Case #3: stupid
Case #4: -
Case #5: lose
Case #6: praise
Case #7: true
Case #8: soft
Case #9: smooth
Case #10: tame
```

You can test your program against both the input provided in the test phase and the input provided in the submit phase. A nice output will tell you if your program got the right solution or not. You can try as many times as you want. Be careful with extra whitespace. The output should be exactly as described.

### Test your program against the input provided in the submit phase

#### Program output

During the submit phase, in some problems, we might give your program harder inputs. As with the test token, a nice output will tell you if your program got the right solution or not. You can try as many times as you need.

In the actual contest you have to solve the test phase before you can submit your code. You must provide the source code used to solve the challenge and you can only make one submission. After your solution is submitted, you won't be able to modify it to fix issues or make it faster.

If you have any doubts, please see the info section.