

def 					__lowercase      (     _A						,    _A			)     ->						int:
      assert x is not None
      assert y is not None

      SCREAMING_SNAKE_CASE :      int       =   len(_A			)
      SCREAMING_SNAKE_CASE :      Union[str, Any]       =   len(_A			)

      # declaring the array for storing the dp values
      SCREAMING_SNAKE_CASE :      Tuple       =   [[0] * (n + 1) for _ in range(m + 1			)]  # noqa: E741

      for i in range(1						,    m + 1			):
            for j in range(1						,    n + 1			):
                  SCREAMING_SNAKE_CASE :      List[Any]       =   1 if x[i - 1] == y[j - 1] else 0

                  SCREAMING_SNAKE_CASE :      int       =   max(l[i - 1][j]						,    l[i][j - 1]						,    l[i - 1][j - 1] + match			)

      SCREAMING_SNAKE_CASE :      int       =   """"""
      SCREAMING_SNAKE_CASE :      int       =   m, n
      while i > 0 and j > 0:
            SCREAMING_SNAKE_CASE :      Tuple       =   1 if x[i - 1] == y[j - 1] else 0

            if l[i][j] == l[i - 1][j - 1] + match:
                  if match == 1:
                        SCREAMING_SNAKE_CASE :      List[Any]       =   x[i - 1] + seq
                  i -= 1
                  j -= 1
            elif l[i][j] == l[i - 1][j]:
                  i -= 1
            else:
                  j -= 1

      return l[m][n], seq


if __name__ == "__main__":
   UpperCAmelCase__ :     str				    =    """AGGTAB"""
   UpperCAmelCase__ :     Optional[int]				    =    """GXTXAYB"""
   UpperCAmelCase__ :     Tuple				    =    4
   UpperCAmelCase__ :     Dict				    =    """GTAB"""

   UpperCAmelCase__ :     Optional[int]				    =    longest_common_subsequence(a, b)
   print("""len =""", ln, """, sub-sequence =""", subseq)
   import doctest

   doctest.testmod()







from math import ceil






def 					__lowercase      (     _A = 1001			)     ->						int:
      SCREAMING_SNAKE_CASE :      Union[str, Any]       =   1

      for i in range(1						,    int(ceil(n / 2.0			)			)			):
            SCREAMING_SNAKE_CASE :      Dict       =   2 * i + 1
            SCREAMING_SNAKE_CASE :      Optional[int]       =   2 * i
            SCREAMING_SNAKE_CASE :      str       =   total + 4 * odd**2 - 6 * even

      return total


if __name__ == "__main__":
  import sys

  if len(sys.argv) == 1:
    print(solution())
  else:
    try:
      UpperCAmelCase__ :     str				    =    int(sys.argv[1])
      print(solution(n))
    except ValueError:
      print("""Invalid entry - please enter a number""")




