

from math import ceil





def    A_  (							a = 1_0_0_1  ):

      """simple docstring"""



      SCREAMING_SNAKE_CASE_				:  Union[str, Any]           =     1

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

      return total


if __name__ == "__main__":
    import sys

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









def    A_  (							a  ):

      """simple docstring"""



      SCREAMING_SNAKE_CASE_				:  List[Any]           =     0
      while num > 0:
            digit_sum += num % 1_0
            num //= 1_0
      return digit_sum

def    A_  (							a = 1_0_0  ):

      """simple docstring"""



      SCREAMING_SNAKE_CASE_				:  List[str]           =     1
      SCREAMING_SNAKE_CASE_				:  Union[str, Any]           =     2

      for i in range(2					,   max_n + 1  ):
            SCREAMING_SNAKE_CASE_				:  List[str]           =     pre_numerator
            SCREAMING_SNAKE_CASE_				:  str           =     2 * i // 3 if i % 3 == 0 else 1
            SCREAMING_SNAKE_CASE_				:  Tuple           =     cur_numerator
            SCREAMING_SNAKE_CASE_				:  Tuple           =     e_cont * pre_numerator + temp

      return sum_digits(a  )


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






