





'''simple docstring'''


from itertools import permutations


def 		__a(SCREAMING_SNAKE_CASE_					:   int = 5      ):



    '''simple docstring'''





    if gon_side < 3 or gon_side > 5:
        raise ValueError("gon_side must be in the range [3, 5]"      )

    # Since it's 16, we know 10 is on the outer ring
    # Put the big numbers at the end so that they are never the first number
    _lowerCAmelCase		     = list(range(gon_side + 1						,    0						,    -1      )      )
    _lowerCAmelCase		     = list(range(gon_side + 2						,    gon_side * 2 + 1      )      )

    for perm in permutations(small_numbers + big_numbers      ):
        _lowerCAmelCase		     = generate_gon_ring(SCREAMING_SNAKE_CASE_						,    list(SCREAMING_SNAKE_CASE_      )      )
        if is_magic_gon(SCREAMING_SNAKE_CASE_      ):
            return int("".join(str(SCREAMING_SNAKE_CASE_      ) for n in numbers      )      )

    _lowerCAmelCase		     = F'''Magic {gon_side}-gon ring is impossible'''
    raise ValueError(SCREAMING_SNAKE_CASE_      )


def 		__a(SCREAMING_SNAKE_CASE_					:   int						,    SCREAMING_SNAKE_CASE_					:   list[int]      ):



    '''simple docstring'''





    _lowerCAmelCase		     = [0] * (gon_side * 3)
    _lowerCAmelCase		     = perm[0:3]
    perm.append(perm[1]      )

    _lowerCAmelCase		     = 1 if gon_side < 5 else 2

    for i in range(1						,    len(SCREAMING_SNAKE_CASE_      ) // 3 + magic_number      ):
        _lowerCAmelCase		     = perm[2 * i + 1]
        _lowerCAmelCase		     = result[3 * i - 1]
        _lowerCAmelCase		     = perm[2 * i + 2]

    return result


def 		__a(SCREAMING_SNAKE_CASE_					:   list[int]      ):



    '''simple docstring'''





    if len(SCREAMING_SNAKE_CASE_      ) % 3 != 0:
        raise ValueError("a gon ring should have a length that is a multiple of 3"      )

    if min(numbers[::3]      ) != numbers[0]:
        return False

    _lowerCAmelCase		     = sum(numbers[:3]      )

    return all(sum(numbers[i : i + 3]      ) == total for i in range(3						,    len(SCREAMING_SNAKE_CASE_      )						,    3      )      )


if __name__ == "__main__":
       print(solution())









'''simple docstring'''


def 		__a(SCREAMING_SNAKE_CASE_					:   int = 1000      ):



    '''simple docstring'''





    return sum(i for i in range(SCREAMING_SNAKE_CASE_      ) if i % 3 == 0 or i % 5 == 0      )


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


