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 in the top 16, they can't advance to the knockout stage
  if chinese_team_rank > 16:
    return 32

  # In the group stage, we can ensure the Chinese team is in a group
  # where they are at least the 2nd strongest, guaranteeing advancement
  
  # In the knockout stage (round of 16), they will face a group winner,
  # which could be any of the top 8 teams

  # Best possible scenario: Chinese team wins against all but the strongest team
  if chinese_team_rank == 2:
    return 2  # Runner-up

  # Next best scenarios: Chinese team loses in the semi-final or quarter-final
  if chinese_team_rank <= 4:
    return 4  # Semi-finalist
  if chinese_team_rank <= 8:
    return 8  # Quarter-finalist

  # Otherwise, they are guaranteed to reach at least the round of 16
  return 16

# 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)