input: from typing import List
  
  def find_whole_day_combinations(hours: List[int]) -> int:
      """
      Given an integer array hours representing times in hours, return the count of pairs i, j where i < j and the sum of hours[i] and hours[j] equals a whole number of days.
  
      A complete day is an exact multiple of 24 hours.
  
      For instance, 1 day equals 24 hours, 2 days equal 48 hours, 3 days equal 72 hours, and so forth.
  
      Examples:
      >>> hours = [12,12,30,24,24]
      2
      >>> hours = [72,48,24,3]
      3
  
      Constraints:
      1 <= len(hours) <= 100
      1 <= hours[i] <= 10^9
      """
output:     count = 0
      n = len(hours)
      for i in range(n):
          for j in range(i + 1, n):
              if (hours[i] + hours[j]) % 24 == 0:
                  count += 1
      return count