def best_possible_result(strengths):
  """
  Calculates the best possible result for the Chinese team in the World Cup,
  considering the ability to manipulate the grouping scheme.

  Args:
      strengths: A list of integers representing the strengths of all 32 teams.

  Returns:
      An integer representing the best possible result for the Chinese team:
      1: Champion, 2: Runner-up, 4: Semi-finalist, 8: Quarter-finalist,
      16: Round of 16, 32: Did not advance.
  """

  chinese_team_strength = strengths[0]

  # Sort strengths in descending order
  strengths.sort(reverse=True)

  # Find the rank of the Chinese team
  chinese_team_rank = strengths.index(chinese_team_strength) + 1

  # If the Chinese team is not the strongest, they can't win the championship
  if chinese_team_rank != 1:
    return 2  # Best possible result is runner-up

  # The Chinese team is the strongest.
  # We can arrange the groups and knockout matches to ensure they win the championship

  return 1  # Champion

# Read the number of test cases
t = int(input())

for _ in range(t):
  strengths = list(map(int, input().split()))
  result = best_possible_result(strengths)
  print(result)