


from __future__ import annotations

from fractions import Fraction
from math import gcd, sqrt



def  _a			(						__UpperCamelCase ):
     a_    :     int										=    int(number**0.5 )
     return number == sq * sq



def  _a			(						__UpperCamelCase  ,  __UpperCamelCase  ,  __UpperCamelCase  ,  __UpperCamelCase  ,  __UpperCamelCase  ,  __UpperCamelCase ):
     a_    :     int										=    x_num * y_den * z_den + y_num * x_den * z_den + z_num * x_den * y_den
     a_    :     int										=    x_den * y_den * z_den
     a_    :     int										=    gcd(__UpperCamelCase  ,  __UpperCamelCase )
     top //= hcf
     bottom //= hcf
     return top, bottom



def  _a			(						__UpperCamelCase = 3_5 ):
     a_    :     set										=    set()
     a_    :     int
     a_    :     Fraction										=    Fraction(0 )
     a_    :     tuple[int, int]

     for x_num in range(1  ,  order + 1 ):
          for x_den in range(x_num + 1  ,  order + 1 ):
               for y_num in range(1  ,  order + 1 ):
                    for y_den in range(y_num + 1  ,  order + 1 ):
                         # n=1
                         a_    :     int										=    x_num * y_den + x_den * y_num
                         a_    :     Optional[int]										=    x_den * y_den
                         a_    :     Optional[Any]										=    gcd(__UpperCamelCase  ,  __UpperCamelCase )
                         z_num //= hcf
                         z_den //= hcf
                         if 0 < z_num < z_den <= order:
                              a_    :     Optional[int]										=    add_three(
                                  __UpperCamelCase  ,  __UpperCamelCase  ,  __UpperCamelCase  ,  __UpperCamelCase  ,  __UpperCamelCase  ,  __UpperCamelCase )
                              unique_s.add(__UpperCamelCase )

                         # n=2
                         a_    :     List[Any]										=    (
                             x_num * x_num * y_den * y_den + x_den * x_den * y_num * y_num
                         )
                         a_    :     str										=    x_den * x_den * y_den * y_den
                         if is_sq(__UpperCamelCase ) and is_sq(__UpperCamelCase ):
                              a_    :     Optional[Any]										=    int(sqrt(__UpperCamelCase ) )
                              a_    :     Optional[int]										=    int(sqrt(__UpperCamelCase ) )
                              a_    :     Optional[Any]										=    gcd(__UpperCamelCase  ,  __UpperCamelCase )
                              z_num //= hcf
                              z_den //= hcf
                              if 0 < z_num < z_den <= order:
                                   a_    :     str										=    add_three(
                                       __UpperCamelCase  ,  __UpperCamelCase  ,  __UpperCamelCase  ,  __UpperCamelCase  ,  __UpperCamelCase  ,  __UpperCamelCase )
                                   unique_s.add(__UpperCamelCase )

                    # n=-1
                         a_    :     Union[str, Any]										=    x_num * y_num
                         a_    :     Tuple										=    x_den * y_num + x_num * y_den
                         a_    :     List[Any]										=    gcd(__UpperCamelCase  ,  __UpperCamelCase )
                         z_num //= hcf
                         z_den //= hcf
                         if 0 < z_num < z_den <= order:
                              a_    :     Union[str, Any]										=    add_three(
                                  __UpperCamelCase  ,  __UpperCamelCase  ,  __UpperCamelCase  ,  __UpperCamelCase  ,  __UpperCamelCase  ,  __UpperCamelCase )
                              unique_s.add(__UpperCamelCase )

                         # n=2
                         a_    :     Union[str, Any]										=    x_num * x_num * y_num * y_num
                         a_    :     Dict										=    (
                             x_den * x_den * y_num * y_num + x_num * x_num * y_den * y_den
                         )
                         if is_sq(__UpperCamelCase ) and is_sq(__UpperCamelCase ):
                              a_    :     Dict										=    int(sqrt(__UpperCamelCase ) )
                              a_    :     Union[str, Any]										=    int(sqrt(__UpperCamelCase ) )
                              a_    :     Dict										=    gcd(__UpperCamelCase  ,  __UpperCamelCase )
                              z_num //= hcf
                              z_den //= hcf
                              if 0 < z_num < z_den <= order:
                                   a_    :     List[Any]										=    add_three(
                                       __UpperCamelCase  ,  __UpperCamelCase  ,  __UpperCamelCase  ,  __UpperCamelCase  ,  __UpperCamelCase  ,  __UpperCamelCase )
                                   unique_s.add(__UpperCamelCase )

     for num, den in unique_s:
          total += Fraction(__UpperCamelCase  ,  __UpperCamelCase )

     return total.denominator + total.numerator


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







from heapq import heappop, heappush

import numpy as np



def  _a			(						__UpperCamelCase  ,  __UpperCamelCase  ,  __UpperCamelCase  ,  __UpperCamelCase  ,  ):
     a_			,			a_    :     Any										=    grid.shape
     a_    :     Dict										=    [-1, 1, 0, 0]
     a_    :     List[Any]										=    [0, 0, -1, 1]
     if allow_diagonal:
          dx += [-1, -1, 1, 1]
          dy += [-1, 1, -1, 1]

     a_			,			a_    :     int										=    [(0, source)], set()
     a_    :     Optional[Any]										=    np.full((rows, cols)  ,  np.inf )
     a_    :     Tuple										=    0
     a_    :     Optional[Any]										=    np.empty((rows, cols)  ,  dtype=__UpperCamelCase )
     a_    :     Optional[Any]										=    None

     while queue:
          ((a_)			,			(a_))    :     Any										=    heappop(__UpperCamelCase )
          if (x, y) in visited:
               continue
          visited.add((x, y) )

          if (x, y) == destination:
               a_    :     Tuple										=    []
               while (x, y) != source:
                    path.append((x, y) )
                    a_			,			a_    :     Any										=    predecessors[x, y]
               path.append(__UpperCamelCase )  # add the source manually
               path.reverse()
               return matrix[destination], path

          for i in range(len(__UpperCamelCase ) ):
               a_			,			a_    :     Dict										=    x + dx[i], y + dy[i]
               if 0 <= nx < rows and 0 <= ny < cols:
                    a_    :     List[Any]										=    grid[nx][ny]
                    if next_node == 1 and matrix[nx, ny] > dist + 1:
                         heappush(__UpperCamelCase  ,  (dist + 1, (nx, ny)) )
                         a_    :     List[str]										=    dist + 1
                         a_    :     Union[str, Any]										=    (x, y)

     return np.inf, []


if __name__ == "__main__":
       import doctest

       doctest.testmod()



