
def        __UpperCamelCase					(    lowerCAmelCase__							:    str  ,       lowerCAmelCase__							:    str  ):
 __a			:  Any		    =  len(lowerCAmelCase__  )
 __a			:  Union[str, Any]		    =  []
 for i in range(len(lowerCAmelCase__  ) - pat_len + 1  ):
  __a			:  List[Any]		    =  True
  for j in range(lowerCAmelCase__  ):
   if s[i + j] != pattern[j]:
    __a			:  Union[str, Any]		    =  False
    break
  if match_found:
   position.append(lowerCAmelCase__  )
 return position


if __name__ == "__main__":
      assert naive_pattern_search('ABCDEFG', 'DE') == [3]
      print(naive_pattern_search('ABAAABCDBBABCDDEBCABC', 'ABC'))


def        __UpperCamelCase					(    lowerCAmelCase__							:    int = 1_0_0_0  ):
 __a			:  int		    =  -1
 __a			:  Any		    =  0
 for a in range(1  ,       n // 3  ):
  # Solving the two equations a**2+b**2=c**2 and a+b+c=N eliminating c
  __a			:  List[Any]		    =  (n * n - 2 * a * n) // (2 * n - 2 * a)
  __a			:  Union[str, Any]		    =  n - a - b
  if c * c == (a * a + b * b):
   __a			:  Union[str, Any]		    =  a * b * c
   if candidate >= product:
    __a			:  List[Any]		    =  candidate
 return product


if __name__ == "__main__":
      print(F"""{solution() = }""")
