"""simple docstring"""




def 							SCREAMING_SNAKE_CASE     (			_lowerCamelCase						:       int = 10**12	)       ->      Dict:
  _lowerCAmelCase						:       Any  			=     1
  _lowerCAmelCase						:       Optional[Any]  			=     0

  _lowerCAmelCase						:       Tuple  			=     1
  _lowerCAmelCase						:       int  			=     1

  while numerator <= 2 * min_total - 1:
    prev_numerator += 2 * numerator
    numerator += 2 * prev_numerator

    prev_denominator += 2 * denominator
    denominator += 2 * prev_denominator

  return (denominator + 1) // 2


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











'''simple docstring'''

from __future__ import annotations





def 						UpperCamelCase				(							_lowerCamelCase					:					list[int | str]       ):
    create_state_space_tree(_lowerCamelCase						,       []						,       0						,       [0 for i in range(len(_lowerCamelCase       )       )]       )





def 						UpperCamelCase				(							_lowerCamelCase					:					list[int | str]						,       _lowerCamelCase					:					list[int | str]						,       _lowerCamelCase					:					int						,       _lowerCamelCase					:					list[int]						,       ):

    if index == len(_lowerCamelCase       ):
        print(_lowerCamelCase       )
        return

    for i in range(len(_lowerCamelCase       )       ):
        if not index_used[i]:
            current_sequence.append(sequence[i]       )
            A__				=			True
            create_state_space_tree(_lowerCamelCase						,       _lowerCamelCase						,       index + 1						,       _lowerCamelCase       )
            current_sequence.pop()
            A__				=			False
__lowerCAmelCase							:	list[int | str]			=[3, 1, 2, 4]
generate_all_permutations(sequence)

__lowerCAmelCase							:	list[int | str]			=["A", "B", "C"]



generate_all_permutations(sequence_a)



