






"""simple docstring"""
def 							A						(				__snake_case: list  )    ->		bool:

       """simple docstring"""





       if not isinstance(__snake_case ,     __snake_case  ):
              raise ValueError('Input series is not valid, valid series - [2, 4, 6]'  )
       if len(__snake_case  ) == 0:
              raise ValueError('Input list must be a non empty list'  )
       if len(__snake_case  ) == 1:
              return True
       __magic_name__      				=    series[1] - series[0]
       for index in range(len(__snake_case  ) - 1  ):
              if series[index + 1] - series[index] != common_diff:
                     return False
       return True


def 							A						(				__snake_case: list  )    ->		float:

       """simple docstring"""





       if not isinstance(__snake_case ,     __snake_case  ):
              raise ValueError('Input series is not valid, valid series - [2, 4, 6]'  )
       if len(__snake_case  ) == 0:
              raise ValueError('Input list must be a non empty list'  )
       __magic_name__      				=    0
       for val in series:
              answer += val
       return answer / len(__snake_case  )


if __name__ == "__main__":
 import doctest

 doctest.testmod()







"""simple docstring"""
def 							A						(				__snake_case: int  )    ->		int:

       """simple docstring"""





       if divisor % 5 == 0 or divisor % 2 == 0:
              return 0
       __magic_name__      				=    1
       __magic_name__      				=    1
       while repunit:
              __magic_name__      				=    (1_0 * repunit + 1) % divisor
              repunit_index += 1
       return repunit_index


def 							A						(				__snake_case: int = 1_0_0_0_0_0_0  )    ->		int:

       """simple docstring"""





       __magic_name__      				=    limit - 1
       if divisor % 2 == 0:
              divisor += 1
       while least_divisible_repunit(__snake_case  ) <= limit:
              divisor += 2
       return divisor


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