You are given an array hours that represents the number of hours an employee worked each day. A day is classified as a tiring day if the employee worked strictly more than 8 hours that day. A well-performing interval is a consecutive sequence of days where the number of tiring days is strictly greater than the number of non-tiring days. Your task is to find the length of the longest well-performing interval. For example, if hours = [9, 9, 6, 0, 6, 6, 9]: Days with hours > 8 are tiring days: positions 0, 1, and 6 (values 9, 9, 9) Days with hours ≤ 8 are non-tiring days: positions 2, 3, 4, 5 (values 6, 0, 6, 6) The interval from index 0 to 2 has 2 tiring days and 1 non-tiring day, making it well-performing The entire array from index 0 to 6 has 3 tiring days and 4 non-tiring days, which is not well-performing The goal is to find the maximum length among all possible well-performing intervals.