Highest Score or Tie

You are given the number of dancers and their individual scores. Your task is to determine the highest score among the dancers. However, if the highest score is achieved by more than one dancer, you must output "Tie".

More formally, let $n$ be the number of dancers and $s_1, s_2, \dots, s_n$ be their scores. Let $M = \max_{1 \leq i \leq n} s_i$. If $M$ occurs exactly once, output $M$; otherwise, output "Tie".

inputFormat

Input is read from standard input (stdin). The first line contains an integer $n$ (the number of dancers). The second line contains $n$ space-separated integers where each integer represents a dancer's score.

outputFormat

Print a single line to standard output (stdout) containing the highest unique score. If the highest score appears more than once, print "Tie".## sample

1
75

75